Digital rights management (DRM) encryption and data-protection for content on device without interactive authentication

ABSTRACT

A device renders content on a medium by obtaining a table from the medium, obtaining a device key (DK) of the device and an index value of such (DK), indexing into an entry of the table based on the obtained index value, selecting an encrypted secret from the indexed-into entry, applying the obtained device key (DK) to the selected encrypted secret to expose the secret, and applying the exposed secret to render the content.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is related to U.S. patent application Ser. No. 09/290,363, filed Apr. 12, 1999 and entitled “ENFORCEMENT ARCHITECTURE AND METHOD FOR DIGITAL RIGHTS MANAGEMENT”, and U.S. Provisional Application No. 60/126,614, filed Mar. 27, 1999 and entitled “ENFORCEMENT ARCHITECTURE AND METHOD FOR DIGITAL RIGHTS MANAGEMENT”, each of which is hereby incorporated by reference in its entirety.

TECHNICAL FIELD

The present invention relates to an architecture for enforcing rights in digital content. More specifically, the present invention relates to such an enforcement architecture that allows access to encrypted digital content only in accordance with parameters specified by license rights acquired by a user of the digital content. Even more specifically, the present invention relates to an architecture for a relatively small and/or simple device with limited decryption and communications capabilities.

BACKGROUND OF THE INVENTION

Digital rights management and enforcement is highly desirable in connection with digital content such as digital audio, digital video, digital text, digital data, digital multimedia, etc., where such digital content is to be distributed to users. Typical modes of distribution include tangible devices such as a magnetic (floppy) disk, a magnetic tape, an optical (compact) disk (CD), etc., and intangible media such as an electronic bulletin board, an electronic network, the Internet, etc. Upon being received by the user, such user renders or ‘plays’ the digital content with the aid of an appropriate rendering device such as a media player on a personal computer or the like.

Typically, a content owner or rights-owner, such as an author, a publisher, a broadcaster, etc. (hereinafter “content owner”), wishes to distribute such digital content to a user or recipient in exchange for a license fee or some other consideration. Such content owner, given the choice, would likely wish to restrict what the user can do with such distributed digital content. For example, the content owner would like to restrict the user from copying and re-distributing such content to a second user, at least in a manner that denies the content owner a license fee from such second user.

In addition, the content owner may wish to provide the user with the flexibility to purchase different types of use licenses at different license fees, while at the same time holding the user to the terms of whatever type of license is in fact purchased. For example, the content owner may wish to allow distributed digital content to be played only a limited number of times, only for a certain total time, only on a certain type of machine, only on a certain type of media player, only by a certain type of user, etc.

However, after distribution has occurred, such content owner has very little if any control over the digital content. This is especially problematic in view of the fact that practically every new or recent personal computer includes the software and hardware necessary to make an exact digital copy of such digital content, and to download such exact digital copy to a write-able magnetic or optical disk, or to send such exact digital copy over a network such as the Internet to any destination.

Of course, as part of the legitimate transaction where the license fee was obtained, the content owner may require the user of the digital content to promise not to re-distribute such digital content. However, such a promise is easily made and easily broken. A content owner may attempt to prevent such re-distribution through any of several known security devices, usually involving encryption and decryption. However, there is likely very little that prevents a mildly determined user from decrypting encrypted digital content, saving such digital content in an un-encrypted form, and then re-distributing same.

A need exists, then, for providing an enforcement architecture and method that allows the controlled rendering or playing of arbitrary forms of digital content, where such control is flexible and definable by the content owner of such digital content. A need also exists for providing a controlled rendering environment on a computing device such as a personal computer, where the rendering environment includes at least a portion of such enforcement architecture. Such controlled rendering environment allows that the digital content will only be rendered as specified by the content owner, even though the digital content is to be rendered on a computing device which is not under the control of the content owner.

Further, a need exists for a trusted component running on the computing device, where the trusted component enforces the rights of the content owner on such computing device in connection with a piece of digital content, even against attempts by the user of such computing device to access such digital content in ways not permitted by the content owner. As but one example, such a trusted software component prevents a user of the computing device from making a copy of such digital content, except as otherwise allowed for by the content owner thereof.

Finally, a need exists for a method and mechanism that allows the digital rights management architecture to be extended to a relatively small and/or simple device. More particularly, a need exists for a version of a digital rights management architecture that allows for encryption and data-protection for content on the relatively small device, even though the device upon which the content is to be rendered is relatively small and/or simple and does not have relatively complex capabilities such as performing asymmetric key decryption and communicating with a remote entity over a network connection or the like. More particularly, a need exists for a mechanism and method that extends the DRM architecture to such relatively small and/or simple device, where the device need not perform asymmetric key decryption and does not require web or network connectivity.

SUMMARY OF THE INVENTION

The aforementioned needs are satisfied at least in part by an enforcement architecture and method for digital rights management, where the architecture and method enforce rights in protected (secure) digital content available on a medium such as the Internet, an optical disk, etc. For purposes of making content available, the architecture includes a content server from which the digital content is accessible over the Internet or the like in an encrypted form. The content server may also supply the encrypted digital content for recording on an optical disk or the like, wherein the encrypted digital content may be distributed on the optical disk itself. At the content server, the digital content is encrypted using an encryption key, and public/private key techniques are employed to bind the digital content with a digital license at the user's computing device or client machine.

When a user attempts to render the digital content on a computing device, the rendering application invokes a Digital Rights Management (DRM) system on such user's computing device. If the user is attempting to render the digital content for the first time, the DRM system either directs the user to a license server to obtain a license to render such digital content in the manner sought, or transparently obtains such license from such license server without any action necessary on the part of the user. The license includes:

-   -   a decryption key (KD) that decrypts the encrypted digital         content;     -   a description of the rights (play, copy, etc.) conferred by the         license and related conditions (begin date, expiration date,         number of plays, etc.), where such description is in a digitally         readable form; and     -   a digital signature that ensures the integrity of the license.

The user should not be able to decrypt and render the encrypted digital content without obtaining such a license from the license server. The obtained license is stored in a license store in the user's computing device.

Importantly, the license server only issues a license to a DRM system that is ‘trusted’ (i.e., that can authenticate itself). To implement ‘trust’, the DRM system is equipped with a ‘black box’ that performs decryption and encryption functions for such DRM system. The black box includes a public/private key pair, a version number and a unique signature, all as provided by an approved certifying authority. The public key is made available to the license server for purposes of encrypting portions of the issued license, thereby binding such license to such black box. The private key is available to the black box only, and not to the user or anyone else, for purposes of decrypting information encrypted with the corresponding public key. The DRM system is initially provided with a black box with a public/private key pair, and the user is prompted to download from a black box server an updated secure black box when the user first requests a license. The black box server provides the updated black box, along with a unique public/private key pair. Such updated black box is written in unique executable code that will run only on the user's computing device, and is re-updated on a regular basis.

When a user requests a license, the client machine sends the black box public key, version number, and signature to the license server, and such license server issues a license only if the version number is current and the signature is valid. A license request also includes an identification of the digital content for which a license is requested and a key ID that identifies the decryption key associated with the requested digital content. The license server uses the black box public key to encrypt the decryption key, and the decryption key to encrypt the license terms, then downloads the encrypted decryption key and encrypted license terms to the user's computing device along with a license signature.

Once the downloaded license has been stored in the DRM system license store, the user can render the digital content according to the rights conferred by the license and specified in the license terms. When a request is made to render the digital content, the black box is caused to decrypt the decryption key and license terms, and a DRM system license evaluator evaluates such license terms. The black box decrypts the encrypted digital content only if the license evaluation results in a decision that the requester is allowed to play such content. The decrypted content is provided to the rendering application for rendering.

In one embodiment of the present invention, each of a plurality of devices has a device key (DK) with a pre-selected index value. Each device is for receiving a storage medium or has the storage medium. The storage medium has stored thereon digital content protected according to a secret and a table with a plurality of entries therein. Each entry includes the secret encrypted according to a key decryptable by the device key (DK) of one of a plurality of devices and an index value.

For the device to render the content on the medium, the device obtains the table from the medium, obtains the device key (DK) of the device and the index value of such (DK), indexes into an entry of the table based on the obtained index value, selects the encrypted secret from the indexed-into entry, applies the obtained device key (DK) to the selected encrypted secret to expose the secret, and applies the exposed secret to render the content.

The storage medium includes an ID thereof thereon. For the host computer to provide the medium with the table, the host computer obtains the table from a cache, obtains the ID of the medium therefrom, appends the obtained ID of the medium to the obtained table, employs a device key (DK) and the index value thereof to find the corresponding entry in the obtained table and exposes the secret of such table, ties the table to the medium by the ID of the medium and the exposed secret, and copies the tied table to the medium.

The provided table is an (N)th table. For the host computer to provide the medium with an (N+1)th, updated table to replace the provided (N)th table on the medium, the host computer obtains the (N+1)th table 64 with an (N+1)th secret from the cache, obtaining the ID of the medium therefrom, appends the obtained ID of the medium to the (N+1)th table, obtains the (N+1)th secret from the (N+1)th table, and obtains the (N)th secret from the (N)th table on the medium and if present a daisy chain of previous secrets in the (N)th table. Each previous secret in the daisy chain is encrypted according to an immediately following secret to form a series of links. The host computer thereafter extends the obtained daisy chain and adds the (N)th secret thereto encrypted according to the (N+1)th secret as another link in the daisy chain, adds the extended daisy chain to the (N+1)th table, adjusts the (N+1)th table to include old secrets for invalidated device keys (DK), assigns a version number to each entry, ties the (N+1)th table to the medium by the ID of the medium and the obtained (N+1)th secret, and copies the adjusted (N+1)th table to the medium to replace the (N)th table thereon.

For the host computer to store digital content on the medium according to the current secret of the table thereon, the host computer obtains the ID from the medium, obtains the current secret from the table, applies the obtained current secret and the obtained ID to a pre-determined function to produce a final secret, protects the content to be stored on the medium according to the final secret, thereby tying the content to the medium by the ID thereof, and copies the protected content to the medium.

BRIEF DESCRIPTION OF THE DRAWINGS

The foregoing summary, as well as the following detailed description of the embodiments of the present invention, will be better understood when read in conjunction with the appended drawings. For the purpose of illustrating the invention, there are shown in the drawings embodiments which are presently preferred. As should be understood, however, the invention is not limited to the precise arrangements and instrumentalities shown. In the drawings:

FIG. 1 is a block diagram showing an enforcement architecture in accordance with one embodiment of the present invention;

FIG. 2 is a block diagram of the authoring tool of the architecture of FIG. 1 in accordance with one embodiment of the present invention;

FIG. 3 is a block diagram of a digital content package having digital content for use in connection with the architecture of FIG. 1 in accordance with one embodiment of the present invention;

FIG. 4 is a block diagram of the user's computing device of FIG. 1 in accordance with one embodiment of the present invention;

FIGS. 5A and 5B are flow diagrams showing the steps performed in connection with the Digital Rights Management (DRM) system of the computing device of FIG. 4 to render content in accordance with one embodiment of the present invention;

FIG. 6 is a flow diagram showing the steps performed in connection with the DRM system of FIG. 4 to determine whether any valid, enabling licenses are present in accordance with one embodiment of the present invention;

FIG. 7 is a flow diagram showing the steps performed in connection with the DRM system of FIG. 4 to obtain a license in accordance with one embodiment of the present invention;

FIG. 8 is a block diagram of a digital license for use in connection with the architecture of FIG. 1 in accordance with one embodiment of the present invention;

FIG. 9 is a flow diagram showing the steps performed in connection with the DRM system of FIG. 4 to obtain a new black box in accordance with one embodiment of the present invention;

FIG. 10 is a flow diagram showing the key transaction steps performed in connection with the DRM system of FIG. 4 to validate a license and a piece of digital content and render the content in accordance with one embodiment of the present invention;

FIG. 11 is a block diagram showing the license evaluator of FIG. 4 along with a Digital Rights License (DRL) of a license and a language engine for interpreting the DRL in accordance with one embodiment of the present invention;

FIG. 12 is a block diagram representing a general purpose computer system in which aspects of the present invention and/or portions thereof may be incorporated;

FIG. 13 is a block diagram showing a simple device, a host computer, and a storage medium having a secret table and encrypted content written to by the host computer and read by the device in accordance with one embodiment of the present invention;

FIGS. 14 and 15 are flow diagrams showing key steps performed by the device of FIG. 13 in rendering the content;

FIG. 16 is a block diagram showing an (N+1)th table as derived from an (N)th table by the host computer of FIG. 13;

FIG. 17 is a flow diagram showing key steps performed by the host computer of FIG. 13 in obtaining a new table for the medium;

FIGS. 18 and 18A are flow diagrams showing key steps performed by the host computer of FIG. 13 in replacing a table on the medium;

FIG. 19 is a flow diagram showing key steps performed by the host computer of FIG. 13 in writing content on the medium; and

FIG. 20 is a flow diagram showing more key steps performed by the device of FIG. 13 in rendering the content.

DETAILED DESCRIPTION OF THE INVENTION

Referring to the drawings in details, wherein like numerals are used to indicate like elements throughout, there is shown in FIG. 1 an enforcement architecture 10 in accordance with one embodiment of the present invention. Overall, the enforcement architecture 10 allows an owner of digital content 12 to specify license rules that must be satisfied before such digital content 12 is allowed to be rendered on a user's computing device 14. Such license rules are embodied within a digital license 16 that the user/user's computing device 14 (hereinafter, such terms are interchangeable unless circumstances require otherwise) must obtain from the content owner or an agent thereof. The digital content 12 is distributed in an encrypted form, and may be distributed freely and widely. Preferably, the decrypting key (KD) for decrypting the digital content 12 is included with the license 16.

Computer Environment

FIG. 12 and the following discussion are intended to provide a brief general description of a suitable computing environment in which the present invention and/or portions thereof may be implemented. Although not required, the invention is described in the general context of computer-executable instructions, such as program modules, being executed by a computer, such as a client workstation or a server. Generally, program modules include routines, programs, objects, components, data structures and the like that perform particular tasks or implement particular abstract data types. Moreover, it should be appreciated that the invention and/or portions thereof may be practiced with other computer system configurations, including hand-held devices, multi-processor systems, microprocessor-based or programmable consumer electronics, network PCs, minicomputers, mainframe computers and the like. The invention may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote memory storage devices.

As shown in FIG. 12, an exemplary general purpose computing system includes a conventional personal computer 120 or the like, including a processing unit 121, a system memory 122, and a system bus 123 that couples various system components including the system memory to the processing unit 121. The system bus 123 may be any of several types of bus structures including a memory bus or memory controller, a peripheral bus, and a local bus using any of a variety of bus architectures. The system memory includes read-only memory (ROM) 124 and random access memory (RAM) 125. A basic input/output system 126 (BIOS), containing the basic routines that help to transfer information between elements within the personal computer 120, such as during start-up, is stored in ROM 124.

The personal computer 120 may further include a hard disk drive 127 for reading from and writing to a hard disk (not shown), a magnetic disk drive 128 for reading from or writing to a removable magnetic disk 129, and an optical disk drive 130 for reading from or writing to a removable optical disk 131 such as a CD-ROM or other optical media. The hard disk drive 127, magnetic disk drive 128, and optical disk drive 130 are connected to the system bus 123 by a hard disk drive interface 132, a magnetic disk drive interface 133, and an optical drive interface 134, respectively. The drives and their associated computer-readable media provide non-volatile storage of computer readable instructions, data structures, program modules and other data for the personal computer 20.

Although the exemplary environment described herein employs a hard disk, a removable magnetic disk 129, and a removable optical disk 131, it should be appreciated that other types of computer readable media which can store data that is accessible by a computer may also be used in the exemplary operating environment. Such other types of media include a magnetic cassette, a flash memory card, a digital video disk, a Bernoulli cartridge, a random access memory (RAM), a read-only memory (ROM), and the like.

A number of program modules may be stored on the hard disk, magnetic disk 129, optical disk 131, ROM 124 or RAM 125, including an operating system 135, one or more application programs 136, other program modules 137 and program data 138. A user may enter commands and information into the personal computer 120 through input devices such as a keyboard 140 and pointing device 142. Other input devices (not shown) may include a microphone, joystick, game pad, satellite disk, scanner, or the like. These and other input devices are often connected to the processing unit 121 through a serial port interface 146 that is coupled to the system bus, but may be connected by other interfaces, such as a parallel port, game port, or universal serial bus (USB). A monitor 147 or other type of display device is also connected to the system bus 123 via an interface, such as a video adapter 148. In addition to the monitor 147, a personal computer typically includes other peripheral output devices (not shown), such as speakers and printers. The exemplary system of FIG. 12 also includes a host adapter 155, a Small Computer System Interface (SCSI) bus 156, and an external storage device 162 connected to the SCSI bus 156.

The personal computer 120 may operate in a networked environment using logical connections to one or more remote computers, such as a remote computer 149. The remote computer 149 may be another personal computer, a server, a router, a network PC, a peer device or other common network node, and typically includes many or all of the elements described above relative to the personal computer 120, although only a memory storage device 150 has been illustrated in FIG. 12. The logical connections depicted in FIG. 12 include a local area network (LAN) 151 and a wide area network (WAN) 152. Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets, and the Internet.

When used in a LAN networking environment, the personal computer 120 is connected to the LAN 151 through a network interface or adapter 153. When used in a WAN networking environment, the personal computer 120 typically includes a modem 154 or other means for establishing communications over the wide area network 152, such as the Internet. The modem 154, which may be internal or external, is connected to the system bus 123 via the serial port interface 146. In a networked environment, program modules depicted relative to the personal computer 120, or portions thereof, may be stored in the remote memory storage device. It will be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers may be used.

Architecture

Referring again to FIG. 1, in one embodiment of the present invention, the architecture 10 includes an authoring tool 18, a content-key database 20, a content server 22, a license server 24, and a black box server 26, as well as the aforementioned user's computing device 14.

Architecture—Authoring Tool 18

The authoring tool 18 is employed by a content owner to package a piece of digital content 12 into a form that is amenable for use in connection with the architecture 10 of the present invention. In particular, the content owner provides the authoring tool 18 with the digital content 12, instructions and/or rules that are to accompany the digital content 12, and instructions and/or rules as to how the digital content 12 is to be packaged. The authoring tool 18 then produces a digital content package 12 p having the digital content 12 encrypted according to an encryption/decryption key, and the instructions and/or rules that accompany the digital content 12.

In one embodiment of the present invention, the authoring tool 18 is instructed to serially produce several different digital content 12 packages 12 p, each having the same digital content 12 encrypted according to a different encryption/decryption key. As should be understood, having several different packages 12 p with the same digital content 12 may be useful for tracking the distribution of such packages 12 p/content 12 (hereinafter simply “digital content 12”, unless circumstances require otherwise). Such distribution tracking is not ordinarily necessary, but may be used by an investigative authority in cases where the digital content 12 has been illegally sold or broadcast.

In one embodiment of the present invention, the encryption/decryption key that encrypts the digital content 12 is a symmetric key, in that the encryption key is also the decryption key (KD). As will be discussed below in more detail, such decryption key (KD) is delivered to a user's computing device 14 in a hidden form as part of a license 16 for such digital content 12. Preferably, each piece of digital content 12 is provided with a content ID (or each package 12 p is provided with a package ID), each decryption key (KD) has a key ID, and the authoring tool 18 causes the decryption key (KD), key ID, and content ID (or package ID) for each piece of digital content 12 (or each package 12 p) to be stored in the content-key database 20. In addition, license data regarding the types of licenses 16 to be issued for the digital content 12 and the terms and conditions for each type of license 16 may be stored in the content-key database 20, or else in another database (not shown). Preferably, the license data can be modified by the content owner at a later time as circumstances and market conditions may require.

In use, the authoring tool 18 is supplied with information including, among other things:

-   -   the digital content 12 to be packaged;     -   the type and parameters of watermarking and/or fingerprinting to         be employed, if any;     -   the type and parameters of data compression to be employed, if         any;     -   the type and parameters of encryption to be employed;     -   the type and parameters of serialization to be employed, if any;         and     -   the instructions and/or rules that are to accompany the digital         content 12.

As is known, a watermark is a hidden, computer-readable signal that is added to the digital content 12 as an identifier. A fingerprint is a watermark that is different for each instance. As should be understood, an instance is a version of the digital content 12 that is unique. Multiple copies of any instance may be made, and any copy is of a particular instance. When a specific instance of digital content 12 is illegally sold or broadcast, an investigative authority can perhaps identify suspects according to the watermark/fingerprint added to such digital content 12.

Data compression may be performed according to any appropriate compression algorithm without departing from the spirit and scope of the present invention. For example, the .mp3 or .wav compression algorithm may be employed. Of course, the digital content 12 may already be in a compressed state, in which case no additional compression is necessary.

The instructions and/or rules that are to accompany the digital content 12 may include practically any appropriate instructions, rules, or other information without departing from the spirit and scope of the present invention. As will be discussed below, such accompanying instructions/rules/information are primarily employed by the user and the user's computing device 14 to obtain a license 16 to render the digital content 12. Accordingly, such accompanying instructions/rules/information may include an appropriately formatted license acquisition script or the like, as will be described in more detail below. In addition, or in the alternative, such accompanying instructions/rules/information may include ‘preview’ information designed to provide a user with a preview of the digital content 12.

With the supplied information, the authoring tool 18 then produces one or more packages 12 p corresponding to the digital content 12. Each package 12 p may then be stored on the content server 22 for distribution to the world.

In one embodiment of the present invention, and referring now to FIG. 2, the authoring tool 18 is a dynamic authoring tool 18 that receives input parameters which can be specified and operated on. Accordingly, such authoring tool 18 can rapidly produce multiple variations of package 12 p for multiple pieces of digital content 12. Preferably, the input parameters are embodied in the form of a dictionary 28, as shown, where the dictionary 28 includes such parameters as:

-   -   the name of the input file 29 a having the digital content 12;     -   the type of encoding that is to take place     -   the encryption/decryption key (KD) to be employed,     -   the accompanying instructions/rules/information (‘header         information’) to be packaged with the digital content 12 in the         package 12 p.     -   the type of muxing that is to occur; and     -   the name of the output file 29 b to which the package 12 p based         on the digital content 12 is to be written.

As should be understood, such dictionary 28 is easily and quickly modifiable by an operator of the authoring tool 18 (human or machine), and therefore the type of authoring performed by the authoring tool 18 is likewise easily and quickly modifiable in a dynamic manner. In one embodiment of the present invention, the authoring tool 18 includes an operator interface (not shown) displayable on a computer screen to a human operator. Accordingly, such operator may modify the dictionary 28 by way of the interface, and further may be appropriately aided and/or restricted in modifying the dictionary 28 by way of the interface.

In the authoring tool 18, and as seen in FIG. 2, a source filter 18 a receives the name of the input file 29 a having the digital content 12 from the dictionary 28, and retrieves such digital content 12 from such input file and places the digital content 12 into a memory 29 c such as a RAM or the like. An encoding filter 18 b then performs encoding on the digital content 12 in the memory 29 c to transfer the file from the input format to the output format according to the type of encoding specified in the dictionary 28 (i.e., .wav to .asp, .mp3 to asp, etc.), and places the encoded digital content 12 in the memory 29 c. As shown, the digital content 12 to be packaged (music, e.g.) is received in a compressed format such as the .wav or .mp3 format, and is transformed into a format such as the .asp (active streaming protocol) format. Of course, other input and output formats may be employed without departing from the spirit and scope of the present invention.

Thereafter, an encryption filter 18 c encrypts the encoded digital content 12 in the memory 29 c according to the encryption/decryption key (KD) specified in the dictionary 28, and places the encrypted digital content 12 in the memory 29 c. A header filter 18 d then adds the header information specified in the dictionary 28 to the encrypted digital content 12 in the memory 29 c.

As should be understood, depending on the situation, the package 12 p may include multiple streams of temporally aligned digital content 12 (one stream being shown in FIG. 2), where such multiple streams are multiplexed (i.e., ‘muxed’). Accordingly, a mux filter 18 e performs muxing on the header information and encrypted digital content 12 in the memory 29 c according to the type of muxing specified in the dictionary 28, and places the result in the memory 29 c. A file writer filter 18 f then retrieves the result from the memory 29 c and writes such result to the output file 29 b specified in the dictionary 28 as the package 12 p.

It should be noted that in certain circumstances, the type of encoding to be performed will not normally change. Since the type of muxing typically is based on the type of encoding, it is likewise the case that the type of muxing will not normally change, either. If this is in fact the case, the dictionary 28 need not include parameters on the type of encoding and/or the type of muxing. Instead, it is only necessary that the type of encoding be ‘hardwired’ into the encoding filter and/or that the type of muxing be ‘hardwired’ into the mux filter. Of course, as circumstance require, the authoring tool 18 may not include all of the aforementioned filters, or may include other filters, and any included filter may be hardwired or may perform its function according to parameters specified in the dictionary 28, all without departing from the spirit and scope of the present invention.

Preferably, the authoring tool 18 is implemented on an appropriate computer, processor, or other computing machine by way of appropriate software. The structure and operation of such machine and such software should be apparent based on the disclosure herein and therefore do not require any detailed discussion in the present disclosure.

Architecture—Content Server 22 Referring again to FIG. 1, in one embodiment of the present invention, the content server 22 distributes or otherwise makes available for retrieval the packages 12 p produced by the authoring tool 18. Such packages 12 p may be distributed as requested by the content server 22 by way of any appropriate distribution channel without departing from the spirit and scope of the present invention. For example, such distribution channel may be the Internet or another network, an electronic bulletin board, electronic mail, or the like. In addition, the content server 22 may be employed to copy the packages 12 p onto magnetic or optical disks or other storage devices, and such storage devices may then be distributed.

It will be appreciated that the content server 22 distributes packages 12 p without regard to any trust or security issues. As discussed below, such issues are dealt with in connection with the license server 24 and the relationship between such license server 24 and the user's computing device 14. In one embodiment of the present invention, the content server 22 freely releases and distributes packages 12 p having digital content 12 to any distributee requesting same. However, the content server 22 may also release and distribute such packages 12 p in a restricted manner without departing from the spirit and scope of the present invention. For example, the content server 22 may first require payment of a pre-determined distribution fee prior to distribution, or may require that a distributee identify itself, or may indeed make a determination of whether distribution is to occur based on an identification of the distributee.

In addition, the content server 22 may be employed to perform inventory management by controlling the authoring tool 18 to generate a number of different packages 12 p in advance to meet an anticipated demand. For example, the server could generate 100 packages 12 p based on the same digital content 12, and serve each package 12 p 10 times. As supplies of packages 12 p dwindle to 20, for example, the content server 22 may then direct the authoring tool 18 to generate 80 additional packages 12 p, again for example.

Preferably, the content server 22 in the architecture 10 has a unique public/private key pair (PU-CS, PR-CS) that is employed as part of the process of evaluating a license 16 and obtaining a decryption key (KD) for decrypting corresponding digital content 12, as will be explained in more detail below. As is known, a public/private key pair is an asymmetric key, in that what is encrypted in one of the keys in the key pair can only be decrypted by the other of the keys in the key pair. In a public/private key pair encryption system, the public key may be made known to the world, but the private key should always be held in confidence by the owner of such private key. Accordingly, if the content server 22 encrypts data with its private key (PR-CS), it can send the encrypted data out into the world with its public key (PU-CS) for decryption purposes. Correspondingly, if an external device wants to send data to the content server 22 so that only such content server 22 can decrypt such data, such external device must first obtain the public key of the content server 22 (PU-CS) and then must encrypt the data with such public key. Accordingly, the content server 22 (and only the content server 22) can then employ its private key (PR-CS) to decrypt such encrypted data.

As with the authoring tool 18, the content server 22 is implemented on an appropriate computer, processor, or other computing machine by way of appropriate software. The structure and operation of such machine and such software should be apparent based on the disclosure herein and therefore do not require any detailed discussion in the present disclosure. Moreover, in one embodiment of the present invention, the authoring tool 18 and the content server 22 may reside on a single computer, processor, or other computing machine, each in a separate work space. It should be recognized, moreover, that the content server 22 may in certain circumstances include the authoring tool 18 and/or perform the functions of the authoring tool 18, as discussed above.

Structure of Digital Content Package 12 p

Referring now to FIG. 3, in one embodiment of the present invention, the digital content package 12 p as distributed by the content server 22 includes:

-   -   the digital content 12 encrypted with the encryption/decryption         key (KD), as was discussed above (i.e., (KD(CONTENT)));     -   the content ID (or package ID) of such digital content 12 (or         package 12 p);     -   the key ID of the decryption key (KD);     -   license acquisition information, preferably in an un-encrypted         form; and     -   the key KD encrypting the content server 22 public key (PU-CS),         signed by the content server 22 private key (PR-CS) (i.e., (KD         (PU-CS) S (PR-CS))).

With regard to (KD (PU-CS) S (PR-CS)), it is to be understood that such item is to be used in connection with validating the digital content 12 and/or package 12 p, as will be explained below. Unlike a certificate with a digital signature (see below), the key (PU-CS) is not necessary to get at (KD (PU-CS)). Instead, the key (PU-CS) is obtained merely by applying the decryption key (KD). Once so obtained, such key (PU-CS) may be employed to test the validity of the signature (S (PR-CS)).

It should also be understood that for such package 12 p to be constructed by the authoring tool 18, such authoring tool 18 must already possess the license acquisition information and (KD (PU-CS) S (PR-CS)), presumably as header information supplied by the dictionary 28. Moreover, the authoring tool 18 and the content server 22 must presumably interact to construct (KD (PU-CS) S (PR-CS)). Such interaction may for example include the steps of:

-   -   the content server 22 sending (PU-CS) to the authoring tool 18;     -   the authoring tool 18 encrypting (PU-CS) with (KD) to produce         (KD (PU-CS));     -   the authoring tool 18 sending (KD (PU-CS)) to the content server         22;     -   the content server 22 signing (KD (PU-CS)) with (PR-CS) to         produce (KD (PU-CS) S (PR-CS)); and     -   the content server 22 sending (KD (PU-CS) S (PR-CS)) to the         authoring tool 18.         Architecture—License Server 24

Referring again to FIG. 1, in one embodiment of the present invention, the license server 24 performs the functions of receiving a request for a license 16 from a user's computing device 14 in connection with a piece of digital content 12, determining whether the user's computing device 14 can be trusted to honor an issued license 16, negotiating such a license 16, constructing such license 16, and transmitting such license 16 to the users computing device 14. Preferably, such transmitted license 16 includes the decryption key (KD) for decrypting the digital content 12. Such license server 24 and such functions will be explained in more detail below. Preferably, and like the content server 22, the license server 24 in the architecture 10 has a unique public/private key pair (PU-LS, PR-LS) that is employed as part of the process of evaluating a license 16 and obtaining a decryption key (KD) for decrypting corresponding digital content 12, as will be explained in more detail below.

As with the authoring tool 18 and the content server 22, the license server 24 is implemented on an appropriate computer, processor, or other computing machine by way of appropriate software. The structure and operation of such machine and such software should be apparent based on the disclosure herein and therefore do not require any detailed discussion in the present disclosure. Moreover, in one embodiment of the present invention the authoring tool 18 and/or the content server 22 may reside on a single computer, processor, or other computing machine together with the license server 24, each in a separate work space.

In one embodiment of the present invention, prior to issuance of a license 16, the license server 24 and the content server 22 enter into an agency agreement or the like, wherein the license server 24 in effect agrees to be the licensing authority for at least a portion of the digital content 12 distributed by the content server 22. As should be understood, one content server 22 may enter into an agency agreement or the like with several license servers 24, and/or one license server 24 may enter into an agency agreement or the like with several content servers 22, all without departing from the spirit and scope of the present invention.

Preferably, the license server 24 can show to the world that it does in fact have the authority to issue a license 16 for digital content 12 distributed by the content server 22. To do so, it is preferable that the license server 24 send to the content server 22 the license server 24 public key (PU-LS), and that the content server 22 then send to the license server 24 a digital certificate containing PU-LS as the contents signed by the content server 22 private key (CERT (PU-LS) S (PR-CS)). As should be understood, the contents (PU-LS) in such certificate can only be accessed with the content server 22 public key (PU-CS). As should also be understood, in general, a digital signature of underlying data is an encrypted form of such data, and will not match such data when decrypted if such data has been adulterated or otherwise modified.

As a licensing authority in connection with a piece of digital content 12, and as part of the licensing function, the license server 24 must have access to the decryption key (KD) for such digital content 12. Accordingly, it is preferable that license server 24 have access to the content-key database 20 that has the decryption key (KD), key ID, and content ID (or package ID) for such digital content 12 (or package 12 p).

Architecture—Black Box Server 26

Still referring to FIG. 1, in one embodiment of the present invention, the black box server 26 performs the functions of installing and/or upgrading a new black box 30 in a user's computing device 14. As will be explained in more detail below, the black box 30 performs encryption and decryption functions for the user's computing device 14. As will also be explained in more detail below, the black box 30 is intended to be secure and protected from attack. Such security and protection is provided, at least in part, by upgrading the black box 30 to a new version as necessary by way of the black box server 26, as will be explained in more detail below.

As with the authoring tool 18, the content server 22, and the license server 24, the black box server 26 is implemented on an appropriate computer, processor, or other computing machine by way of appropriate software. The structure and operation of such machine and such software should be apparent based on the disclosure herein and therefore do not require any detailed discussion in the present disclosure. Moreover, in one embodiment of the present invention the license server 24, the authoring tool 18, and/or the content server 22 may reside on a single computer, processor, or other computing machine together with the black box server 26, each in a separate work space. Note, though, that for security purposes, it may be wise to have the black box server 26 on a separate machine.

Architecture—User's Computing Device 14

Referring now to FIG. 4, in one embodiment of the present invention, the user's computing device 14 is a personal computer or the like, having elements including a keyboard, a mouse, a screen, a processor, RAM, ROM, a hard drive, a floppy drive, a CD player, and/or the like. However, the user's computing device 14 may also be a dedicated viewing device such as a television or monitor, a dedicated audio device such as a stereo or other music player, a dedicated printer, or the like, among other things, all without departing from the spirit and scope of the present invention.

The content owner for a piece of digital content 12 must trust that the user's computing device 14 will abide by the rules specified by such content owner, i.e. that the digital content 12 will not be rendered unless the user obtains a license 16 that permits the rendering in the manner sought. Preferably, then, the user's computing device 14 must provide a trusted component or mechanism 32 that can satisfy to the content owner that such computing device 14 will not render the digital content 12 except according to the license rules embodied in the license 16 associated with the digital content 12 and obtained by the user.

Here, the trusted mechanism 32 is a Digital Rights Management (DRM) system 32 that is enabled when a user requests that a piece of digital content 12 be rendered, that determines whether the user has a license 16 to render the digital content 12 in the manner sought, that effectuates obtaining such a license 16 if necessary, that determines whether the user has the right to play the digital content 12 according to the license 16, and that decrypts the digital content 12 for rendering purposes if in fact the user has such right according to such license 16. The contents and function of the DRM system 32 on the user's computing device 14 and in connection with the architecture 10 are described below.

DRM System 32

The DRM system 32 performs four main functions with the architecture 10 disclosed herein: (1) content acquisition, (2) license acquisition, (3) content rendering, and (4) black box 30 installation/update. Preferably, any of the functions can be performed at any time, although it is recognized that some of the functions already require that digital content 12 be acquired.

DRM System 32—Content Acquisition

Acquisition of digital content 12 by a user and/or the user's computing device 14 is typically a relatively straight-forward matter and generally involves placing a file having encrypted digital content 12 on the user's computing device 14. Of course, to work with the architecture 10 and the DRM system 32 disclosed herein, it is necessary that the encrypted digital content 12 be in a form that is amenable to such architecture 10 and DRM system 32, such as the digital package 12 p as will be described below.

As should be understood, the digital content 12 may be obtained in any manner from a content server 22, either directly or indirectly, without departing from the spirit and scope of the present invention. For example, such digital content 12 may be downloaded from a network such as the Internet, located on an obtained optical or magnetic disk or the like, received as part of an E-mail message or the like, or downloaded from an electronic bulletin board or the like.

Such digital content 12, once obtained, is preferably stored in a manner such that the obtained digital content 12 is accessible by a rendering application 34 (to be described below) running on the computing device 14, and by the DRM system 32. For example, the digital content 12 may be placed as a file on a hard drive (not shown) of the user's computing device 14, or on a network server (not shown) accessible to the computing device 14. In the case where the digital content 12 is obtained on an optical or magnetic disk or the like, it may only be necessary that such disk be present in an appropriate drive (not shown) coupled to the user's computing device 14.

In the present invention, it is not envisioned that any special tools are necessary to acquire digital content 12, either from the content server 22 as a direct distribution source or from some intermediary as an indirect distribution source. That is, it is preferable that digital content 12 be as easily acquired as any other data file. However, the DRM system 32 and/or the rendering application 34 may include an interface (not shown) designed to assist the user in obtaining digital content 12. For example, the interface may include a web browser especially designed to search for digital content 12, links to pre-defined Internet web sites that are known to be sources of digital content 12, and the like.

DRM SYSTEM 32—Content Rendering, Part 1

Referring now to FIG. 5A, in one embodiment of the present invention, assuming the encrypted digital content 12 has been distributed to and received by a user and placed by the user on the computing device 14 in the form of a stored file, the user will attempt to render the digital content 12 by executing some variation on a render command (step 501). For example, such render command may be embodied as a request to ‘play’ or ‘open’ the digital content 12. In some computing environments, such as for example the “MICROSOFT WINDOWS” operating system, distributed by MICROSOFT Corporation of Redmond, Wash., such play or open command may be as simple as ‘clicking’ on an icon representative of the digital content 12. Of course, other embodiments of such render command may be employed without departing from the spirit and scope of the present invention. In general, such render command may be considered to be executed whenever a user directs that a file having digital content 12 be opened, run, executed, and/or the like.

Importantly, and in addition, such render command may be embodied as a request to copy the digital content 12 to another form, such as to a printed form, a visual form, an audio form, etc. As should be understood, the same digital content 12 may be rendered in one form, such as on a computer screen, and then in another form, such as a printed document. In the present invention, each type of rendering is performed only if the user has the right to do so, as will be explained below.

In one embodiment of the present invention, the digital content 12 is in the form of a digital file having a file name ending with an extension, and the computing device 14 can determine based on such extension to start a particular kind of rendering application 34. For example, if the file name extension indicates that the digital content 12 is a text file, the rendering application 34 is some form of word processor such as the “MICROSOFT WORD”, distributed by MICROSOFT Corporation of Redmond, Wash. Likewise, if the file name extension indicates that the digital content 12 is an audio, video, and/or multimedia file, the rendering application 34 is some form of multimedia player, such as “MICROSOFT MEDIA PLAYER”, also distributed by MICROSOFT Corporation of Redmond, Wash.

Of course, other methods of determining a rendering application may be employed without departing from the spirit and scope of the present invention. As but one example, the digital content 12 may contain meta-data in an un-encrypted form (i.e., the aforementioned header information), where the meta-data includes information on the type of rendering application 34 necessary to render such digital content 12.

Preferably, such rendering application 34 examines the digital content 12 associated with the file name and determines whether such digital content 12 is encrypted in a rights-protected form (steps 503, 505). If not protected, the digital content 12 may be rendered without further ado (step 507). If protected, the rendering application 34 determines from the encrypted digital content 12 that the DRM system 32 is necessary to play such digital content 12. Accordingly, such rendering application 34 directs the user's computing device 14 to run the DRM system 32 thereon (step 509). Such rendering application 34 then calls such DRM system 32 to decrypt the digital content 12 (step 511). As will be discussed in more detail below, the DRM system 32 in fact decrypts the digital content 12 only if the user has a valid license 16 for such digital content 12 and the right to play the digital content 12 according to the license rules in the valid license 16. Preferably, once the DRM system 32 has been called by the rendering application 34, such DRM system 32 assumes control from the rendering application 34, at least for purposes of determining whether the user has a right to play such digital content 12 (step 513).

DRM System 32 Components

In one embodiment of the present invention, and referring again to FIG. 4, the DRM system 32 includes a license evaluator 36, the black box 30, a license store 38, and a state store 40.

DRM System 32 Components—License Evaluator 36

The license evaluator 36 locates one or more licenses 16 that correspond to the requested digital content 12, determines whether such licenses 16 are valid, reviews the license rules in such valid licenses 16, and determines based on the reviewed license rules whether the requesting user has the right to render the requested digital content 12 in the manner sought, among other things. As should be understood, the license evaluator 36 is a trusted component in the DRM system 32. In the present disclosure, to be ‘trusted’ means that the license server 24 (or any other trusting element) is satisfied that the trusted element will carry out the wishes of the owner of the digital content 12 according to the rights description in the license 16, and that a user cannot easily alter such trusted element for any purpose, nefarious or otherwise.

The license evaluator 36 has to be trusted in order to ensure that such license evaluator 36 will in fact evaluate a license 16 properly, and to ensure that such license evaluator 36 has not been adulterated or otherwise modified by a user for the purpose of bypassing actual evaluation of a license 16. Accordingly, the license evaluator 36 is run in a protected or shrouded environment such that the user is denied access to such license evaluator 36. Other protective measures may of course be employed in connection with the license evaluator 36 without departing from the spirit and scope of the present invention.

DRM System 32 Components—Black Box 30

Primarily, and as was discussed above, the black box 30 performs encryption and decryption functions in the DRM system 32. In particular, the black box 30 works in conjunction with the license evaluator 36 to decrypt and encrypt certain information as part of the license evaluation function. In addition, once the license evaluator 36 determines that a user does in fact have the right to render the requested digital content 12 in the manner sought, the black box 30 is provided with a decryption key (KD) for such digital content 12, and performs the function of decrypting such digital content 12 based on such decryption key (KD).

The black box 30 is also a trusted component in the DRM system 32. In particular, the license server 24 must trust that the black box 30 will perform the decryption function only in accordance with the license rules in the license 16, and also trust that such black box 30 will not operate should it become adulterated or otherwise modified by a user for the nefarious purpose of bypassing actual evaluation of a license 16. Accordingly, the black box 30 is also run in a protected or shrouded environment such that the user is denied access to such black box 30. Again, other protective measures may be employed in connection with the black box 30 without departing from the spirit and scope of the present invention. Preferably, and like the content server 22 and license server 24, the black box 30 in the DRM system 32 has a unique public/private key pair (PU-BB, PR-BB) that is employed as part of the process of evaluating the license 16 and obtaining a decryption key (KD) for decrypting the digital content 12, as will be described in more detail below.

DRM System 32 Components—License Store 38

The license store 38 stores licenses 16 received by the DRM system 32 for corresponding digital content 12. The license store 38 itself need not be trusted since the license store 38 merely stores licenses 16, each of which already has trust components built thereinto, as will be described below. In one embodiment of the present invention, the license store 38 is merely a sub-directory of a drive such as a hard disk drive or a network drive. However, the license store 38 may be embodied in any other form without departing from the spirit and scope of the present invention, so long as such license store 38 performs the function of storing licenses 16 in a location relatively convenient to the DRM system 32.

DRM System 32 Components—State Store 40

The state store 40 performs the function of maintaining state information corresponding to licenses 16 presently or formerly in the license store 38. Such state information is created by the DRM system 32 and stored in the state store 40 as necessary. For example, if a particular license 16 only allows a pre-determined number of renderings of a piece of corresponding digital content 12, the state store 40 maintains state information on how many renderings have in fact taken place in connection with such license 16. The state store 40 continues to maintain state information on licenses 16 that are no longer in the license store 38 to avoid the situation where it would otherwise be advantageous to delete a license 16 from the license store 38 and then obtain an identical license 16 in an attempt to delete the corresponding state information from the state store 40.

The state store 40 also has to be trusted in order to ensure that the information stored therein is not reset to a state more favorable to a user. Accordingly, the state store 40 is likewise run in a protected or shrouded environment such that the user is denied access to such state store 40. Once again, other protective measures may of course be employed in connection with the state store 40 without departing from the spirit and scope of the present invention. For example, the state store 40 may be stored by the DRM system 32 on the computing device 14 in an encrypted form.

DRM SYSTEM 32—Content Rendering, Part 2

Referring again to FIG. 5A, and again discussing content rendering in one embodiment of the present invention, once the DRM system 32 has assumed control from the calling rendering application 34, such DRM system 32 then begins the process of determining whether the user has a right to render the requested digital content 12 in the manner sought. In particular, the DRM system 32 either locates a valid, enabling license 16 in the license store (steps 515, 517) or attempts to acquire a valid, enabling license 16 from the license server 24 (i.e. performs the license acquisition function as discussed below and as shown in FIG. 7).

As a first step, and referring now to FIG. 6, the license evaluator 36 of such DRM system 32 checks the license store 38 for the presence of one or more received licenses 16 that correspond to the digital content 12 (step 601). Typically, the license 16 is in the form of a digital file, as will be discussed below, although it will be recognized that the license 16 may also be in other forms without departing from the spirit and scope of the present invention. Typically, the user will receive the digital content 12 without such license 16, although it will likewise be recognized that the digital content 12 may be received with a corresponding license 16 without departing from the spirit and scope of the present invention.

As was discussed above in connection with FIG. 3, each piece of digital content 12 is in a package 12 p with a content ID (or package ID) identifying such digital content 12 (or package 12 p), and a key ID identifying the decryption key (KD) that will decrypt the encrypted digital content 12. Preferably, the content ID (or package ID) and the key ID are in an un-encrypted form. Accordingly, and in particular, based on the content ID of the digital content 12, the license evaluator 36 looks for any license 16 in the license store 38 that contains an identification of applicability to such content ID. Note that multiple such licenses 16 may be found, especially if the owner of the digital content 12 has specified several different kinds of licenses 16 for such digital content 12, and the user has obtained multiple ones of such licenses 16. If in fact the license evaluator 36 does not find in the license store 38 any license 16 corresponding to the requested digital content 12, the DRM system 32 may then perform the function of license acquisition (step 519 of FIG. 5), to be described below.

Assume now that the DRM system 32 has been requested to render a piece of digital content 12, and one or more licenses 16 corresponding thereto are present in the license store 38. In one embodiment of the present invention, then, the license evaluator 36 of the DRM system 32 proceeds to determine for each such license 16 whether such license 16 itself is valid (steps 603 and 605 of FIG. 6). Preferably, and in particular, each license 16 includes a digital signature 26 based on the content 28 of the license 16. As should be understood, the digital signature 26 will not match the license 16 if the content 28 has been adulterated or otherwise modified. Thus, the license evaluator 36 can determine based on the digital signature 26 whether the content 28 is in the form that it was received from the license server 24 (i.e., is valid). If no valid license 16 is found in the license store 38, the DRM system 32 may then perform the license acquisition function described below to obtain such a valid license 16.

Assuming that one or more valid licenses 16 are found, for each valid license 16, the license evaluator 36 of the DRM system 32 next determines whether such valid license 16 gives the user the right to render the corresponding digital content 12 in the manner desired (i.e., is enabling) (steps 607 and 609). In particular, the license evaluator 36 determines whether the requesting user has the right to play the requested digital content 12 based on the rights description in each license 16 and based on what the user is attempting to do with the digital content 12. For example, such rights description may allow the user to render the digital content 12 into a sound, but not into a decrypted digital copy.

As should be understood, the rights description in each license 16 specifies whether the user has rights to play the digital content 12 based on any of several factors, including who the user is, where the user is located, what type of computing device 14 the user is using, what rendering application 34 is calling the DRM system 32, the date, the time, etc. In addition, the rights description may limit the license 16 to a pre-determined number of plays, or pre-determined play time, for example. In such case, the DRM system 32 must refer to any state information with regard to the license 16, (i.e., how many times the digital content 12 has been rendered, the total amount of time the digital content 12 has been rendered, etc.), where such state information is stored in the state store 40 of the DRM system 32 on the user's computing device 14.

Accordingly, the license evaluator 36 of the DRM system 32 reviews the rights description of each valid license 16 to determine whether such valid license 16 confers the rights sought to the user. In doing so, the license evaluator 36 may have to refer to other data local to the user's computing device 14 to perform a determination of whether the user has the rights sought. As seen in FIG. 4, such data may include an identification 42 of the user's computing device (machine) 14 and particular aspects thereof, an identification 44 of the user and particular aspects thereof, an identification of the rendering application 34 and particular aspects thereof, a system clock 46, and the like. If no valid license 16 is found that provides the user with the right to render the digital content 12 in the manner sought, the DRM system 32 may then perform the license acquisition function described below to obtain such a license 16, if in fact such a license 16 is obtainable.

Of course, in some instances the user cannot obtain the right to render the digital content 12 in the manner requested, because the content owner of such digital content 12 has in effect directed that such right not be granted. For example, the content owner of such digital content 12 may have directed that no license 16 be granted to allow a user to print a text document, or to copy a multimedia presentation into an un-encrypted form. In one embodiment of the present invention, the digital content 12 includes data on what rights are available upon purchase of a license 16, and types of licenses 16 available. However, it will be recognized that the content owner of a piece of digital content 12 may at any time change the rights currently available for such digital content 12 by changing the licenses 16 available for such digital content 12.

DRM SYSTEM 32—License Acquisition

Referring now to FIG. 7, if in fact the license evaluator 36 does not find in the license store 38 any valid, enabling license 16 corresponding to the requested digital content 12, the DRM system 32 may then perform the function of license acquisition. As shown in FIG. 3, each piece of digital content 12 is packaged with information in an un-encrypted form regarding how to obtain a license 16 for rendering such digital content 12 (i.e., license acquisition information).

In one embodiment of the present invention, such license acquisition information may include (among other things) types of licenses 16 available, and one or more Internet web sites or other site information at which one or more appropriate license servers 24 may be accessed, where each such license server 24 is in fact capable of issuing a license 16 corresponding to the digital content 12. Of course, the license 16 may be obtained in other manners without departing from the spirit and scope of the present invention. For example, the license 16 may be obtained from a license server 24 at an electronic bulletin board, or even in person or via regular mail in the form of a file on a magnetic or optical disk or the like.

Assuming that the location for obtaining a license 16 is in fact a license server 24 on a network, the license evaluator 36 then establishes a network connection to such license server 24 based on the web site or other site information, and then sends a request for a license 16 from such connected license server 24 (steps 701, 703). In particular, once the DRM system 32 has contacted the license server 24, such DRM system 32 transmits appropriate license request information 36 to such license server 24. In one embodiment of the present invention, such license 16 request information 36 may include:

-   -   the public key of the black box 30 of the DRM system 32 (PU-BB);     -   the version number of the black box 30 of the DRM system 32;     -   a certificate with a digital signature from a certifying         authority certifying the black box 30 (where the certificate may         in fact include the aforementioned public key and version number         of the black box 30);     -   the content ID (or package ID) that identifies the digital         content 12 (or package 12 p);     -   the key ID that identifies the decryption key (KD) for         decrypting the digital content 12;     -   the type of license 16 requested (if in fact multiple types are         available);     -   the type of rendering application 34 that requested rendering of         the digital content 12;     -   and/or the like, among other things. Of course, greater or         lessor amounts of license 16 request information 36 may be         transmitted to the license server 24 by the DRM system 32         without departing from the spirit and scope of the present         invention. For example, information on the type of rendering         application 34 may not be necessary, while additional         information about the user and/or the user's computing device 14         may be necessary.

Once the license server 24 has received the license 16 request information 36 from the DRM system 32, the license server 24 may then perform several checks for trust/authentication and for other purposes. In one embodiment of the present invention, such license server 24 checks the certificate with the digital signature of the certifying authority to determine whether such has been adulterated or otherwise modified (steps 705, 707). If so, the license server 24 refuses to grant any license 16 based on the request information 36. The license server 24 may also maintain a list of known ‘bad’ users and/or user's computing devices 14, and may refuse to grant any license 16 based on a request from any such bad user and/or bad user's computing device 14 on the list. Such ‘bad’ list may be compiled in any appropriate manner without departing from the spirit and scope of the present invention.

Based on the received request and the information associated therewith, and particularly based on the content ID (or package ID) in the license request information, the license server 24 can interrogate the content-key database 20 (FIG. 1) and locate a record corresponding to the digital content 12 (or package 12 p) that is the basis of the request. As was discussed above, such record contains the decryption key (KD), key ID, and content ID for such digital content 12. In addition, such record may contain license data regarding the types of licenses 16 to be issued for the digital content 12 and the terms and conditions for each type of license 16. Alternatively, such record may include a pointer, link, or reference to a location having such additional information.

As mentioned above, multiple types of licenses 16 may be available. For example, for a relatively small license fee, a license 16 allowing a limited number of renderings may be available. For a relatively greater license fee, a license 16 allowing unlimited renderings until an expiration date may be available. For a still greater license fee, a license 16 allowing unlimited renderings without any expiration date may be available. Practically any type of license 16 having any kind of license terms may be devised and issued by the license server 24 without departing from the spirit and scope of the present invention.

In one embodiment of the present invention, the request for a license 16 is accomplished with the aid of a web page or the like as transmitted from the license server 24 to the user's computing device 14. Preferably, such web page includes information on all types of licenses 16 available from the license server 24 for the digital content 12 that is the basis of the license 16 request.

In one embodiment of the present invention, prior to issuing a license 16, the license server 24 checks the version number of the black box 30 to determine whether such black box 30 is relatively current (steps 709, 711). As should be understood, the black box 30 is intended to be secure and protected from attacks from a user with nefarious purposes (i.e., to improperly render digital content 12 without a license 16, or outside the terms of a corresponding license 16). However, it is to be recognized that no system and no software device is in fact totally secure from such an attack.

As should also be understood, if the black box 30 is relatively current, i.e., has been obtained or updated relatively recently, it is less likely that such black box 30 has been successfully attacked by such a nefarious user. Preferably, and as a matter of trust, if the license server 24 receives a license request with request information 36 including a black box 30 version number that is not relatively current, such license server 24 refuses to issue the requested license 16 until the corresponding black box 30 is upgraded to a current version, as will be described below. Put simply, the license server 24 will not trust such black box 30 unless such black box 30 is relatively current.

In the context of the black box 30 of the present invention, the term ‘current’ or ‘relatively current’ may have any appropriate meaning without departing from the spirit and scope of the present invention, consistent with the function of providing trust in the black box 30 based on the age or use thereof. For example, ‘current’ may be defined according to age (i.e., less than one month old). As an alternative example, ‘current’ may be defined based on a number of times that the black box 30 has decrypted digital content 12 (i.e., less than 200 instances of decryption). Moreover, ‘current’ may be based on policy as set by each license server 24, where one license server 24 may define ‘current’ differently from another license server 24, and a license server 24 may further define ‘current’ differently depending on the digital content 12 for which a license 16 is requested, or depending on the type of license 16 requested, among other things.

Assuming that the license server 24 is satisfied from the version number of a black box 30 or other indicia thereof that such black box 30 is current, the license server 24 then proceeds to negotiate terms and conditions for the license 16 with the user (step 713). Alternatively, the license server 24 negotiates the license 16 with the user, then satisfies itself from the version number of the black box 30 that such black box 30 is current (i.e., performs step 713, then step 711). Of course, the amount of negotiation varies depending on the type of license 16 to be issued, and other factors. For example, if the license server 24 is merely issuing a paid-up unlimited use license 16, very little need be negotiated. On the other hand, if the license 16 is to be based on such items as varying values, sliding scales, break points, and other details, such items and details may need to be worked out between the license server 24 and the user before the license 16 can be issued.

As should be understood, depending on the circumstances, the license negotiation may require that the user provide further information to the license server 24 (for example, information on the user, the user's computing device 14, etc.). Importantly, the license negotiation may also require that the user and the license server 24 determine a mutually acceptable payment instrument (a credit account, a debit account, a mailed check, etc.) and/or payment method (paid-up immediately, spread over a period of time, etc.), among other things.

Once all the terms of the license 16 have been negotiated and agreed to by both the license server 24 and user (step 715), a digital license 16 is generated by the license server 24 (step 719), where such generated license 16 is based at least in part on the license request, the black box 30 public key (PU-BB), and the decryption key (KD) for the digital content 12 that is the basis of the request as obtained from the content-key database 20. In one embodiment of the present invention, and as seen in FIG. 8, the generated license 16 includes:

-   -   the content ID of the digital content 12 to which the license 16         applies;     -   a Digital Rights License (DRL) 48 (i.e., the rights description         or actual terms and conditions of the license 16 written in a         predetermined form that the license evaluator 36 can         interrogate), perhaps encrypted with the decryption key (KD)         (i.e., KD (DRL));     -   the decryption key (KD) for the digital content 12 encrypted         with the black box 30 public key (PU-BB) as receive in the         license request (i.e.,(PU-BB (KD));     -   a digital signature from the license server 24 (without any         attached certificate) based on (KD (DRL)) and (PU-BB (KD)) and         encrypted with the license server 24 private key (i.e., (S         (PR-LS))); and     -   the certificate that the license server 24 obtained previously         from the content server 22, such certificate indicating that the         license server 24 has the authority from the content server 22         to issue the license 16 (i.e., (CERT (PU-LS) S (PR-CS))).

As should be understood, the aforementioned elements and perhaps others are packaged into a digital file or some other appropriate form. As should also be understood, if the DRL 48 or (PU-BB (KD)) in the license 16 should become adulterated or otherwise modified, the digital signature (S (PR-LS)) in the license 16 will not match and therefore will not validate such license 16. For this reason, the DRL 48 need not necessarily be in an encrypted form (i.e., (KD(DRL)) as mentioned above), although such encrypted form may in some instances be desirable and therefore may be employed without departing from the spirit and scope of the present invention.

Once the digital license 16 has been prepared, such license 16 is then issued to the requestor (i.e., the DRM system 32 on the user's computing device 14) (step 719 of FIG. 7). Preferably, the license 16 is transmitted over the same path through which the request therefor was made (i.e., the Internet or another network), although another path may be employed without departing from the spirit and scope of the present invention. Upon receipt, the requesting DRM system 32 preferably automatically places the received digital license 16 in the license store 38 (step 721).

It is to be understood that a user's computing device 14 may on occasion malfunction, and licenses 16 stored in the license store 38 of the DRM system 32 on such user's computing device 14 may become irretrievably lost. Accordingly, it is preferable that the license server 24 maintain a database 50 of issued licenses 16 (FIG. 1), and that such license server 24 provide a user with a copy or re-issue (hereinafter ‘re-issue’) of an issued license 16 if the user is in fact entitled to such re-issue. In the aforementioned case where licenses 16 are irretrievably lost, it is also likely the case that state information stored in the state store 40 and corresponding to such licenses 16 is also lost. Such lost state information should be taken into account when re-issuing a license 16. For example, a fixed number of renderings license 16 might legitimately be re-issued in a pro-rated form after a relatively short period of time, and not re-issued at all after a relatively longer period of time.

DRM System 32—Installation/Upgrade of Black Box 30

As was discussed above, as part of the function of acquiring a license 16, the license server 24 may deny a request for a license 16 from a user if the user's computing device 14 has a DRM system 32 with a black box 30 that is not relatively current, i.e., has a relatively old version number. In such case, it is preferable that the black box 30 of such DRM system 32 be upgraded so that the license acquisition function can then proceed. Of course, the black box 30 may be upgraded at other times without departing from the spirit and scope of the present invention.

Preferably, as part of the process of installing the DRM system 32 on a user's computing device 14, a non-unique ‘lite’ version of a black box 30 is provided. Such ‘lite’ black box 30 is then upgraded to a unique regular version prior to rendering a piece of digital content 12. As should be understood, if each black box 30 in each DRM system 32 is unique, a security breach into one black box 30 cannot easily be replicated with any other black box 30.

Referring now to FIG. 9, the DRM system 32 obtains the unique black box 30 by requesting same from a black box server 26 or the like (as was discussed above and as shown in FIG. 1) (step 901). Typically, such request is made by way of the Internet, although other means of access may be employed without departing from the spirit and scope of the present invention. For example, the connection to a black box server 26 may be a direct connection, either locally or remotely. An upgrade from one unique non-lite black box 30 to another unique non-lite black box 30 may also be requested by the DRM system 32 at any time, such as for example a time when a license server 24 deems the black box 30 not current, as was discussed above.

Thereafter, the black box server 26 generates a new unique black box 30 (step 903). As seen in FIG. 3, each new black box 30 is provided with a version number and a certificate with a digital signature from a certifying authority. As was discussed above in connection with the license acquisition function, the version number of the black box 30 indicates the relative age and/or use thereof. The certificate with the digital signature from the certifying authority, also discussed above in connection with the license acquisition function, is a proffer or vouching mechanism from the certifying authority that a license server 24 should trust the black box 30. Of course, the license server 24 must trust the certifying authority to issue such a certificate for a black box 30 that is in fact trustworthy. It may be the case, in fact, that the license server 24 does not trust a particular certifying authority, and refuses to honor any certificate issued by such certifying authority. Trust may not occur, for example, if a particular certifying authority is found to be engaging in a pattern of improperly issuing certificates.

Preferably, and as was discussed above, the black box server 26 includes a new unique public/private key pair (PU-BB, PR-BB) with the newly generated unique black box 30 (step 903 of FIG. 9). Preferably, the private key for the black box 30 (PR-BB) is accessible only to such black box 30, and is hidden from and inaccessible by the remainder of the world, including the computing device 14 having the DRM system 32 with such black box 30, and the user thereof.

Most any hiding scheme may be employed without departing from the spirit and scope of the present invention, so long as such hiding scheme in fact performs the function of hiding the private key (PR-BB) from the world. As but one example, the private key (PR-BB) may be split into several sub-components, and each sub-component may be encrypted uniquely and stored in a different location. In such a situation, it is preferable that such sub-components are never assembled in full to produce the entire private key (PR-BB).

In one embodiment of the present invention, such private key (PR-BB) is encrypted according to code-based encryption techniques. In particular, in such embodiment, the actual software code of the black box 30 (or other software code) is employed as encrypting key(s). Accordingly, if the code of the black box 30 (or the other software code) becomes adulterated or otherwise modified, for example by a user with nefarious purposes, such private key (PR-BB) cannot be decrypted.

Although each new black box 30 is delivered with a new public/private key pair (PU-BB, PR-BB), such new black box 30 is also preferably given access to old public/private key pairs from old black boxes 30 previously delivered to the DRM system 32 on the user's computing device 14 (step 905). Accordingly, the upgraded black box 30 can still employ the old key pairs to access older digital content 12 and older corresponding licenses 16 that were generated according to such old key pairs, as will be discussed in more detail below.

Preferably, the upgraded black box 30 delivered by the black box server 26 is tightly tied to or associated with the user's computing device 14. Accordingly, the upgraded black box 30 cannot be operably transferred among multiple computing devices 14 for nefarious purposes or otherwise. In one embodiment of the present invention, as part of the request for the black box 30 (step 901) the DRM system 32 provides hardware information unique to such DRM system 32 and/or unique to the user's computing device 14 to the black box server 26, and the black box server 26 generates a black box 30 for the DRM system 32 based in part on such provided hardware information. Such generated upgraded black box 30 is then delivered to and installed in the DRM system 32 on the user's computing device 14 (steps 907, 909). If the upgraded black box 30 is then somehow transferred to another computing device 14, the transferred black box 30 recognizes that it is not intended for such other computing device 14, and does not allow any requested rendering to proceed on such other computing device 14.

Once the new black box 30 is installed in the DRM system 32, such DRM system 32 can proceed with a license acquisition function or with any other function.

DRM System 32—Content Rendering, Part 3

Referring now to FIG. 5B, and assuming, now, that the license evaluator 36 has found at least one valid license 16 and that at least one of such valid licenses 16 provides the user with the rights necessary to render the corresponding digital content 12 in the manner sought (i.e., is enabling), the license evaluator 36 then selects one of such licenses 16 for further use (step 519). Specifically, to render the requested digital content 12, the license evaluator 36 and the black box 30 in combination obtain the decryption key (KD) from such license 16, and the black box 30 employs such decryption key (KD) to decrypt the digital content 12. In one embodiment of the present invention, and as was discussed above, the decryption key (KD) as obtained from the license 16 is encrypted with the black box 30 public key (PU-BB(KD)), and the black box 30 decrypts such encrypted decryption key with its private key (PR-BB) to produce the decryption key (KD) (steps 521, 523). However, other methods of obtaining the decryption key (KD) for the digital content 12 may be employed without departing from the spirit and scope of the present invention.

Once the black box 30 has the decryption key (KD) for the digital content 12 and permission from the license evaluator 36 to render the digital content 12, control may be returned to the rendering application 34 (steps 525, 527). In one embodiment of the present invention, the rendering application 34 then calls the DRM system 32/black box 30 and directs at least a portion of the encrypted digital content 12 to the black box 30 for decryption according to the decryption key (KD) (step 529). The black box 30 decrypts the digital content 12 based upon the decryption key (KD) for the digital content 12, and then the black box 30 returns the decrypted digital content 12 to the rendering application 34 for actual rendering (steps 533, 535). The rendering application 34 may either send a portion of the encrypted digital content 12 or the entire digital content 12 to the black box 30 for decryption based on the decryption key (KD) for such digital content 12 without departing from the spirit and scope of the present invention.

Preferably, when the rendering application 34 sends digital content 12 to the black box 30 for decryption, the black box 30 and/or the DRM system 32 authenticates such rendering application 34 to ensure that it is in fact the same rendering application 34 that initially requested the DRM system 32 to run (step 531). Otherwise, the potential exists that rendering approval may be obtained improperly by basing the rendering request on one type of rendering application 34 and in fact rendering with another type of rendering application 34. Assuming the authentication is successful and the digital content 12 is decrypted by the black box 30, the rendering application 34 may then render the decrypted digital content 12 (steps 533, 535).

Sequence of Key Transactions

Referring now to FIG. 10, in one embodiment of the present invention, a sequence of key transactions is performed to obtain the decryption key (KD) and evaluate a license 16 for a requested piece of digital content 12 (i.e., to perform steps 515-523 of FIGS. 5A and 5B). Mainly, in such sequence, the DRM system 32 obtains the decryption key (KD) from the license 16, uses information obtained from the license 16 and the digital content 12 to authenticate or ensure the validity of both, and then determines whether the license 16 in fact provides the right to render the digital content 12 in the manner sought. If so, the digital content 12 may be rendered.

Bearing in mind that each license 16 for the digital content 12, as seen in FIG. 8, includes:

-   -   the content ID of the digital content 12 to which the license 16         applies;     -   the Digital Rights License (DRL) 48, perhaps encrypted with the         decryption key (KD) (i.e., KD (DRL));     -   the decryption key (KD) for the digital content 12 encrypted         with the black box 30 public key (PU-BB) (i.e.,(PU-BB (KD));     -   the digital signature from the license server 24 based on (KD         (DRL)) and (PU-BB (KD)) and encrypted with the license server 24         private key (i.e., (S (PR-LS))); and     -   the certificate that the license server 24 obtained previously         from the content server 22 (i.e., (CERT (PU-LS) S (PR-CS))),

and also bearing in mind that the package 12 p having the digital content 12, as seen in FIG. 3, includes:

-   -   the content ID of such digital content 12;     -   the digital content 12 encrypted by KD (i.e., (KD(CONTENT)));     -   a license acquisition script that is not encrypted; and     -   the key KD encrypting the content server 22 public key (PU-CS),         signed by the content server 22 private key (PR-CS) (i.e., (KD         (PU-CS) S (PR-CS))),

in one embodiment of the present invention, the specific sequence of key transactions that are performed with regard to a specific one of the licenses 16 for the digital content 12 is as follows:

1. Based on (PU-BB (KD)) from the license 16, the black box 30 of the DRM system 32 on the user's computing device 14 applies its private key (PR-BB) to obtain (KD) (step 1001). (PR-BB (PU-BB (KD))=(KD)). Note, importantly, that the black box 30 could then proceed to employ KD to decrypt the digital content 12 without any further ado. However, and also importantly, the license server 24 trusts the black box 30 not to do so. Such trust was established at the time such license server 24 issued the license 16 based on the certificate from the certifying authority vouching for the trustworthiness of such black box 30. Accordingly, despite the black box 30 obtaining the decryption key (KD) as an initial step rather than a final step, the DRM system 32 continues to perform all license 16 validation and evaluation functions, as described below.

2. Based on (KD (PU-CS) S (PR-CS)) from the digital content 12, the black box 30 applies the newly obtained decryption key (KD) to obtain (PU-CS) (step 1003). (KD (KD (PU-CS))=(PU-CS)). Additionally, the black box 30 can apply (PU-CS) as against the signature (S (PR-CS)) to satisfy itself that such signature and such digital content 12/package 12 p is valid (step 1005). If not valid, the process is halted and access to the digital content 12 is denied.

3. Based on (CERT (PU-LS) S (PR-CS)) from the license 16, the black box 30 applies the newly obtained content server 22 public key (PU-CS) to satisfy itself that the certificate is valid (step 1007), signifying that the license server 24 that issued the license 16 had the authority from the content server 22 to do so, and then examines the certificate contents to obtain (PU-LS) (step 1009). If not valid, the process is halted and access to the digital content 12 based on the license 16 is denied.

4. Based on (S (PR-LS)) from the license 16, the black box 30 applies the newly obtained license server 24 public key (PU-LS) to satisfy itself that the license 16 is valid (step 1011). If not valid, the process is halted and access to the digital content 12 based on the license 16 is denied.

5. Assuming all validation steps are successful, and that the DRL 48 in the license 16 is in fact encrypted with the decryption key (KD), the license evaluator 36 then applies the already-obtained decryption key (KD) to (KD(DRL)) as obtained from the license 16 to obtain the license terms from the license 16 (i.e., the DRL 48) (step 1013). Of course, if the DRL 48 in the license 16 is not in fact encrypted with the decryption key (KD), step 1013 may be omitted. The license evaluator 36 then evaluates/interrogates the DRL 48 and determines whether the user's computing device 14 has the right based on the DRL 48 in the license 16 to render the corresponding digital content 12 in the manner sought (i.e., whether the DRL 48 is enabling) (step 1015). If the license evaluator 36 determines that such right does not exist, the process is halted and access to the digital content 12 based on the license 16 is denied.

6. Finally, assuming evaluation of the license 16 results in a positive determination that the user's computing device 14 has the right based on the DRL 48 terms to render the corresponding digital content 12 in the manner sought, the license evaluator 36 informs the black box 30 that such black box 30 can render the corresponding digital content 12 according to the decryption key (KD). The black box 30 thereafter applies the decryption key (KD) to decrypt the digital content 12 from the package 12 p (i.e., (KD(KD(CONTENT))=(CONTENT)) (step 1017).

It is important to note that the above-specified series of steps represents an alternating or ‘ping-ponging’ between the license 16 and the digital content 12. Such ping-ponging ensures that the digital content 12 is tightly bound to the license 16, in that the validation and evaluation process can only occur if both the digital content 12 and license 16 are present in a properly issued and valid form. In addition, since the same decryption key (KD) is needed to get the content server 22 public key (PU-CS) from the license 16 and the digital content 12 from the package 12 p in a decrypted form (and perhaps the license terms (DRL 48) from the license 16 in a decrypted form), such items are also tightly bound. Signature validation also ensures that the digital content 12 and the license 16 are in the same form as issued from the content server 22 and the license server 24, respectively. Accordingly, it is difficult if not impossible to decrypt the digital content 12 by bypassing the license server 24, and also difficult if not impossible to alter and then decrypt the digital content 12 or the license 16.

In one embodiment of the present invention, signature verification, and especially signature verification of the license 16, is alternately performed as follows. Rather than having a signature encrypted by the private key of the license server 16 (PR-LS), as is seen in FIG. 8, each license 16 has a signature encrypted by a private root key (PR-R) (not shown), where the black box 30 of each DRM system 32 includes a public root key (PU-R) (also not shown) corresponding to the private root key (PR-R). The private root key (PR-R) is known only to a root entity, and a license server 24 can only issue licenses 16 if such license server 24 has arranged with the root entity to issue licenses 16.

In particular, in such embodiment:

1. the license server 24 provides its public key (PU-LS) to the root entity;

2. the root entity returns the license server public key (PU-LS) to such license server 24 encrypted with the private root key (PR-R) (i.e., (CERT (PU-LS) S (PR-R))); and

3. the license server 24 then issues a license 16 with a signature encrypted with the license server private key (S (PR-LS)), and also attaches to the license the certificate from the root entity (CERT (PU-LS) S (PR-R)).

For a DRM system 18 to validate such issued license 16, then, the DRM system 18:

1. applies the public root key (PU-R) to the attached certificate (CERT (PU-LS) S (PR-R)) to obtain the license server public key (PU-LS); and

2. applies the obtained license server public key (PU-LS) to the signature of the license 16 (S (PR-LS).

Importantly, it should be recognized that just as the root entity gave the license server 24 permission to issue licenses 16 by providing the certificate (CERT (PU-LS) S (PR-R)) to such license server 24, such license server 24 can provide a similar certificate to a second license server 24 (i.e., (CERT (PU-LS2) S (PR-LS1)), thereby allowing the second license server to also issue licenses 16. As should now be evident, a license 16 issued by the second license server would include a first certificate (CERT (PU-LS1) S (PR-R)) and a second certificate (CERT (PU-LS2) S (PR-LS1)). Likewise, such license 16 is validated by following the chain through the first and second certificates. Of course, additional links in the chain may be added and traversed.

One advantage of the aforementioned signature verification process is that the root entity may periodically change the private root key (PR-R), thereby likewise periodically requiring each license server 24 to obtain a new certificate (CERT (PU-LS) S (PR-R)). Importantly, as a requirement for obtaining such new certificate, each license server may be required to upgrade itself. As with the black box 30, if a license server 24 is relatively current, i.e., has been upgraded relatively recently, it is less likely that license server 24 has been successfully attacked. Accordingly, as a matter of trust, each license server 24 is preferably required to be upgraded periodically via an appropriate upgrade trigger mechanism such as the signature verification process. Of course, other upgrade mechanisms may be employed without departing from the spirit and scope of the present invention.

Of course, if the private root key (PR-R) is changed, then the public root key (PU-R) in each DRM system 18 must also be changed. Such change may for example take place during a normal black box 30 upgrade, or in fact may require that a black box 30 upgrade take place. Although a changed public root key (PU-R) may potentially interfere with signature validation for an older license 16 issued based on an older private root key (PR-R), such interference may be minimized by requiring that an upgraded black box 30 remember all old public root keys (PU-R). Alternatively, such interference may be minimized by requiring signature verification for a license 16 only once, for example the first time such license 16 is evaluated by the license evaluator 36 of a DRM system 18. In such case, state information on whether signature verification has taken place should be compiled, and such state information should be stored in the state store 40 of the DRM system 18.

Digital Rights License 48

In one embodiment of the present invention, the license evaluator 36 evaluates a Digital Rights License (DRL) 48 as the rights description or terms of a license 16 to determine if such DRL 48 allows rendering of a corresponding piece of digital content 12 in the manner sought. In one embodiment of the present invention, the DRL 48 may be written by a licensor (i.e., the content owner) in any DRL language.

As should be understood, there are a multitude of ways to specify a DRL 48. Accordingly, a high degree of flexibility must be allowed for in any DRL language. However, it is impractical to specify all aspects of a DRL 48 in a particular license language, and it is highly unlikely that the author of such a language can appreciate all possible licensing aspects that a particular digital licensor may desire. Moreover, a highly sophisticated license language may be unnecessary and even a hindrance for a licensor providing a relatively simple DRL 48. Nevertheless, a licensor should not be unnecessarily restricted in how to specify a DRL 48. At the same time, the license evaluator 36 should always be able to get answers from a DRL 48 regarding a number of specific license questions.

In the present invention, and referring now to FIG. 11, a DRL 48 can be specified in any license language, but includes a language identifier or tag 54. The license evaluator 36 evaluating the license 16, then, performs the preliminary step of reviewing the language tag 54 to identify such language, and then selects an appropriate license language engine 52 for accessing the license 16 in such identified language. As should be understood, such license language engine 52 must be present and accessible to the license evaluator 36. If not present, the language tag 54 and/or the DRL 48 preferably includes a location 56 (typically a web site) for obtaining such language engine 52.

Typically, the language engine 52 is in the form of an executable file or set of files that reside in a memory of the user's computing device 14, such as a hard drive. The language engine 52 assists the license evaluator 36 to directly interrogate the DRL 48, the license evaluator 36 interrogates the DRL 48 indirectly via the language engine 48 acting as an intermediary, or the like. When executed, the language engine 52 runs in a work space in a memory of the user's computing device 14, such as RAM. However, any other form of language engine 52 may be employed without departing from the spirit and scope of the present invention.

Preferably, any language engine 52 and any DRL language supports at least a number of specific license questions that the license evaluator 36 expects to be answered by any DRL 48, as will be discussed below. Accordingly, the license evaluator 36 is not tied to any particular DRL language; a DRL 48 may be written in any appropriate DRL language; and a DRL 48 specified in a new license language can be employed by an existing license evaluator 36 by having such license evaluator 36 obtain a corresponding new language engine 52.

DRL Languages

Two examples of DRL languages, as embodied in respective DRLs 48, are provided below. The first, ‘simple’ DRL 48 is written in a DRL language that specifies license attributes, while the second ‘script’ DRL 48 is written in a DRL language that can perform functions according to the script specified in the DRL 48. While written in a DRL language, the meaning of each line of code should be apparent based on the linguistics thereof and/or on the attribute description chart that follows:

Simple DRL 48:

-   <LICENSE> -   <DATA> -   <NAME>Beastie Boy's Play</NAME> -   <ID>39384</ID> -   <DESCRIPTION>Play the song 3 times</DESCRIPTION> -   <TERMS></TERMS> -   <VALIDITY> -   <NOTBEFORE>19980102 23:20:14Z</NOTBEFORE> -   <NOTAFTER>19980102 23:20:14Z</NOTAFTER></VALIDITY> -   <ISSUEDDATE>19980102 23:20:14Z</ISSUEDDATE> -   <LICENSORSITE>http://www.foo.com</LICENSORSITE> -   <CONTENT> -   <NAME>Beastie Boy's</NAME> -   <ID>392</ID> -   <KEYID>39292</KEYID> -   <TYPE>MS Encrypted ASF 2.0</TTYPE> -   </CONTENT> -   <OWNER> -   <ID>939KDKD393KD</ID> -   <NAME>Universal</NAME> -   <PUBLICKEY></PUBLICKEY> -   </OWNER> -   <LICENSEE> -   <NAME>Arnold</NAME> -   <ID>939KDKD393KD</ID> -   <PUBLICKEY></PUBLICKEY> -   </LICENSEE> -   <PRINCIPAL TYPE==AND=> -   <PRINCIPAL TYPE==OR=> -   <PRINCIPAL> -   <TYPE>x86Computer</TYPE> -   <ID>3939292939d9e939</ID> -   <NAME>Personal Computer</NAME> -   <AUTHTYPE>Intel Authenticated Boot PC SHA-1 DSA512</AUTHTYPE> -   <AUTHDATA>29293939</AUTHDATA> -   </PRINCIPAL> -   <PRINCIPAL> -   <TYPE>Application</TYPE> -   <ID>2939495939292</ID> -   <NAME>Window=s Media Player</NAME> -   <AUTHTYPE>Authenticode SHA-1</AUTHTYPE> -   <AUTHDATA>93939</AUTHDATA> -   </PRINCIPAL> -   </PRINCIPAL> -   <PRINCIPAL> -   <TYPE>Person</TYPE> -   <ID>39299482010</ID> -   <NAME>Arnold Blinn</NAME> -   <AUTHTYPE>Authenticate user</AUTHTYPE> -   <AUTHDATA>\\redmond\arnoldb</AUTHDATA> -   </PRINCIPAL> -   </PRINCIPAL> -   <DRLTYPE>Simple</DRLTYPE>[the language tag 54] -   <DRLDATA> -   <START>19980102 23:20:14Z</START> -   <END>19980102 23:20:14Z</END> -   <COUNT>3</COUNT> -   <ACTION>PLAY</ACTION> -   </DRLDATA> -   <ENABLINGBITS>aaaabbbbccccdddd</ENABLINGBITS> -   </DATA> -   <SIGNATURE> -   <SIGNERNAME>Universal</SIGNERNAME> -   <SIGNERID>9382ABK3939DKD</SIGNERID> -   <HASHALGORITHMID>MD5</HASHALGORITHMID> -   <SIGNALGORITHMID>RSA 128</SIGNALGORITHMID> -   <SIGNATURE>xxxyyyxxxyyyxxxyyy</SIGNATURE> -   <SIGNERPUBLICKEY></SIGNERPUBLICKEY> -   <CONTENTSIGNEDSIGNERPUBLICKEY></CONTENTSIGNEDSIGNERPUBLIC KEY> -   </SIGNATURE> -   </LICENSE>     Script DRL 48: -   <LICENSE> -   <DATA> -   <NAME>Beastie Boy's Play</NAME> -   <ID>39384</ID> -   <DESCRIPTION>Play the song unlimited</DESCRIPTION> -   <TERMS></TERMS> -   <VALIDITY> -   <NOTBEFORE>19980102 23:20:14Z</NOTBEFORE> -   <NOTAFTER>19980102 23:20:14Z</NOTAFTER> -   </VALIDITY> -   <ISSUEDDATE>19980102 23:20:14Z</ISSUEDDATE> -   <LICENSORSITE>http://www.foo.com</LICENSORSITE> -   <CONTENT> -   <NAME>Beastie Boy's</NAME -   <ID>392</ID> -   <KEYID>39292</KEYID> -   <TYPE>MS Encrypted ASF 2.0</TTYPE> -   </CONTENT> -   <OWNER> -   <ID>939KDKD393KD</ID> -   <NAME>Universal</NAME> -   <PUBLICKEY></PUBLICKEY> -   </OWNER> -   <LICENSEE> -   <NAME>Arnold</NAME> -   <ID>939KDKD393KD</ID> -   <PUBLICKEY></PUBLICKEY> -   </LICENSEE> -   <DRLTYPE>Script</DRLTYPE> [the language tag 54] -   <DRLDATA> -   function on_enable(action, args) as boolean -   result=False -   if action=“PLAY” then -   result=True -   end if -   on_action=False -   end function -   . . . -   </DRLDATA> -   </DATA> -   <SIGNATURE> -   <SIGNERNAME>Universal</SIGNERNAME> -   <SIGNERID>9382</SIGNERID> -   <SIGNERPUBLICKEY></SIGNERPUBLICKEY> -   <HASHID>MD5</HASHID> -   <SIGNID>RSA 128</SIGNID> -   <SIGNATURE>xxxyyyxxxyyyxxxyyy</SIGNATURE> -   <CONTENTSIGNEDSIGNERPUBLICKEY></CONTENTSIGNEDSIGNERPUBLIC KEY> -   </SIGNATURE> -   </LICENSE>

In the two DRLs 48 specified above, the attributes listed have the following descriptions and data types:

Attribute Description Data Type Id ID of the license GUID Name Name of the license String Content Id ID of the content GUID Content Key Id ID for the encryption key of the GUID content Content Name Name of the content String Content Type Type of the content String Owner Id ID of the owner of the content GUID Owner Name Name of the owner of the content String Owner Public Key Public key for owner of content. String This is a base-64 encoded public key for the owner of the content. Licensee Id Id of the person getting license. It GUID may be null. Licensee Name Name of the person getting license. String It may be null. Licensee Public Key Public key of the licensee. This is String Description Simple human readable description String of the license Terms Legal terms of the license. This String may be a pointer to a web page containing legal prose. Validity Not After Validity period of license expiration Date Validity Not Before Validity period of license start Date Issued Date Date the license was issued Date DRL Type Type of the DRL. Example include String “SIMPLE” or “SCRIPT” DRL Data Data specific to the DRL String Enabling Bits These are the bits that enable String access to the actual content. The interpretation of these bits is up to the application, but typically this will be the private key for decryption of the content. This data will be base- 64 encoded. Note that these bits are encrypted using the public key of the individual machine. Signer Id ID of person signing license GUID Signer Name Name of person signing license String Signer Public Key Public key for person signing String license. This is the base-64 encode public key for the signer. Content Signed Signer Public key for person signing the String Public Key license that has been signed by the content server private key. The public key to verify this signature will be encrypted in the content. This is base-64 encoded. Hash AIg Id Algorithm used to generate hash. String This is a string, such as “MD5”. Signature Alg Id Algorithm used to generate String signature. This is a string, such as “RSA 128”. Signature Signature of the data. This is base- String 64 encoded data. Methods

As was discussed above, it is preferable that any language engine 52 and any DRL language support at least a number of specific license questions that the digital license evaluator 36 expects to be answered by any DRL 48. Recognizing such supported questions may include any questions without departing from the spirit and scope of the present invention, and consistent with the terminology employed in the two DRL 48 examples above, in one embodiment of the present invention, such supported questions or ‘methods’ include ‘access methods’, ‘DRL methods’, and ‘enabling use methods’, as follows:

Access Methods

Access methods are used to query a DRL 48 for top-level attributes.

VARIANT QueryAttribute (BSTR key)

Valid keys include License.Name, License.Id, Content.Name, Content.Id, Content.Type, Owner.Name, Owner.Id, Owner.PublicKey, Licensee.Name, Licensee.Id, Licensee.PublicKey, Description, and Terms, each returning a BSTR variant; and Issued, Validity.Start and Validity.End, each returning a Date Variant.

DRL Methods

The implementation of the following DRL methods varies from DRL 48 to DRL 48. Many of the DRL methods contain a variant parameter labeled ‘data’ which is intended for communicating more advanced information with a DRL 48. It is present largely for future expandability.

Boolean IsActivated(Variant data)

This method returns a Boolean indicating whether the DRL 48/license 16 is activated. An example of an activated license 16 is a limited operation license 16 that upon first play is active for only 48 hours.

Activate(Variant data)

This method is used to activate a license 16. Once a license 16 is activated, it cannot be deactivated.

Variant QueryDRL(Variant data)

This method is used to communicate with a more advanced DRL 48. It is largely about future expandability of the DRL 48 feature set.

Variant GetExpires(BSTR action, Variant data)

This method returns the expiration date of a license 16 with regard to the passed-in action. If the return value is NULL, the license 16 is assumed to never expire or does not yet have an expiration date because it hasn't been activated, or the like.

Variant GetCount(BSTR action, Variant data)

This method returns the number of operations of the passed-in action that are left. If NULL is returned, the operation can be performed an unlimited number of times.

Boolean IsEnabled(BSTR action, Variant data)

This method indicates whether the license 16 supports the requested action at the present time.

Boolean IsSunk(BSTR action, Variant data)

This method indicates whether the license 16 has been paid for. A license 16 that is paid for up front would return TRUE, while a license 16 that is not paid for up front, such as a license 16 that collects payments as it is used, would return FALSE.

Enabling Use Methods

These methods are employed to enable a license 16 for use in decrypting content.

Boolean Validate (BSTR key)

This method is used to validate a license 16. The passed-in key is the black box 30 public key (PU-BB) encrypted by the decryption key (KD) for the corresponding digital content 12 (i.e.,(KD(PU-BB))) for use in validation of the signature of the license 16. A return value of TRUE indicates that the license 16 is valid. A return value of FALSE indicates invalid.

int OpenLicense 16(BSTR action, BSTR key, Variant data)

This method is used to get ready to access the decrypted enabling bits. The passed-in key is (KD(PU-BB)) as described above. A return value of 0 indicates success. Other return values can be defined.

BSTR GetDecryptedEnablingBits (BSTR action, Variant data)

Variant GetDecryptedEnablingBitsAsBinary (BSTR action, Variant Data)

These methods are used to access the enabling bits in decrypted form. If this is not successful for any of a number of reasons, a null string or null variant is returned.

void CloseLicense (BSTR action, Variant data)

This method is used to unlock access to the enabling bits for performing the passed-in action. If this is not successful for any of a number of reasons, a null string is returned.

Heuristics

As was discussed above, if multiple licenses 16 are present for the same piece of digital content 12, one of the licenses 16 must be chosen for further use. Using the above methods, the following heuristics could be implemented to make such choice. In particular, to perform an action (say ‘PLAY’) on a piece of digital content 12, the following steps could be performed:

-   -   1. Get all licenses 16 that apply to the particular piece of         digital content 12.     -   2. Eliminate each license 16 that does not enable the action by         calling the IsEnabled function on such license 16.     -   3. Eliminate each license 16 that is not active by calling         IsActivated on such license 16.     -   4. Eliminate each license 16 that is not paid for up front by         calling IsSunk on such license 16.     -   5. If any license 16 is left, use it. Use an         unlimited-number-of-plays license 16 before using a         limited-number-of-plays license 16, especially if the         unlimited-number-of-plays license 16 has an expiration date. At         any time, the user should be allowed to select a specific         license 16 that has already been acquired, even if the choice is         not cost-effective. Accordingly, the user can select a license         16 based on criteria that are perhaps not apparent to the DRM         system 32.     -   6. If there are no licenses 16 left, return status so         indicating.         The user would then be given the option of:     -   using a license 16 that is not paid for up front, if available;     -   activating a license 16, if available; and/or     -   performing license acquisition from a license server 24.         Simplified Decryption for a Relatively Simple Device

As should be appreciated, the DRM architecture 10 as has been set forth above is a technology to protect digital content 12 by among other things having a users computing device 14 authenticate itself as a legitimate DRM component in the architecture prior to receiving a license 16 to render the content 12. Such authentication includes an interactive process including signed certificates, negotiations, exchanges of asymmetric and symmetric keys, and the like, where the interactive process is accomplished over a network connection or the like between the computing device 14 and a remote entity such as a license server 24.

However, it is to be appreciated that in some instances the device upon which the content 12 is to be rendered is relatively small and/or simple and does not have relatively complex capabilities such as performing asymmetric key decryption and communicating with a remote entity over a network connection or the like in the interactive process set forth above. Instead, such relatively small and/or simple device typically can receive content 12 and the like on a storage medium or download such content 12 and the like from a host computer into an internal memory. Accordingly, a need exists for a mechanism and method that extends the DRM architecture 10 to such relatively small and/or simple device, where the device need not perform asymmetric key decryption and does not require web or network connectivity.

Briefly, in the present invention, such device is pre-authorized by being granted a device key (DK) and some form of a DRM system, and authorization is confirmed through a table, where the DRM system uses (DK) to unlock a secret such as a password or a further decryption key. The table may accompany the content 12 on pre-recorded media such as a magnetic or optical data disk or a data card, or in a broadcast or other mass publication of the content directly to an memory of the device. The device is authorized to use the content 12 by virtue of having (DK) and the DRM system, which allows access into the table.

Referring now to FIG. 13, it is seen that in one mode of obtaining and rendering digital content 12, such digital content 12 is downloaded from a source 60 and is placed on a storage medium 61 that is either then mounted to a relatively small and/or simple device 62 or internal to such device 62. The source 60 may be any appropriate source without departing from the spirit and scope of the present invention, bearing in mind that an appropriate connection must exist between the source 60 and the storage medium 61. Similarly, the storage medium 61 may also be any appropriate medium without departing from the spirit and scope of the present invention.

For example, the source 60 may be a host computer, a remote server location, or a combination thereof, with the content 12 thereon or available therethrough. Similarly, the storage medium 61 may be portable, such as an optical disk, a magnetic disk, a media card, or the like, or may be an internal memory of the device 62. In the former case, it may for example be the case that the content 12 and associated data are downloaded from the source 60 at a kiosk, perhaps at a retail outlet. In the latter case, it may for example be the case that the device 62 is coupled to a source 60 such as for example a host computer and the content 12 and associated data are downloaded directly thereto.

In one embodiment of the present invention, when the content 12 is downloaded to the medium 61, a corresponding digital license 16 is also obtained and downloaded or otherwise placed on the medium 61. The license 16 may be a license obtained for the medium 61, or may be a sub-license 16 s derived from a license 16 obtained for another computing device 14, such as for example a host computer. A method for deriving a sub-license 16 s from a license 16 is set forth in U.S. patent application Ser. No. 09/892,371, filed Jun. 27, 2001, hereby incorporated by reference in its entirety. Alternatively, the obtained content 12 may include the obtained license 16 therein.

Typically, the device 62 has a relatively small amount of memory set aside for player operations such as decrypting content, rendering content, and the like. With a relatively small amount of memory, the device 62 likely cannot perform asymmetric (i.e., public key-private key) decryption. Accordingly, in one embodiment of the present invention, the device 62 performs symmetric decryption only by way of a portable DRM system 32 p (FIG. 13) instantiated in a memory thereon.

In one embodiment of the present invention, and as with the subject matter disclosed in the aforementioned U.S. patent application Ser. No. 09/892,371, all obtaining of digital content 12 and corresponding digital licenses 16 or sub-licenses 16 s for the medium 61 is performed by way of a host computer or the like, such as for example an at-home personal computer or a computer at a kiosk in a retail location. In particular, the host computer obtains a license 16 for corresponding digital content 16 and then (if necessary) issues a sub-license 16 s to the medium 61 for rendering the digital content 12 on the device 62. Such sub-license 16 s may be issued in the course of downloading the digital content 12 from the source 60 to the medium 61, or may be issued at a time before or after downloading the digital content 12 from the source 60 to the medium 61, or at another time, all without departing from the spirit and scope of the present invention.

As may be appreciated, if a sub-license 16 s is issued, such issued sub-license 16 s may specify the limitations, if any, that must be satisfied to render the corresponding content 12 on the medium 61 at the device 62. Of course, such sub-license 16 s may be issued only if permitted according to the terms of the corresponding license 16 as obtained from an appropriate license server 24. In issuing the sub-license 16 s, at least a portion thereof is re-written to be in a form that is more amenable to the device 62. In particular, the computer 60 re-encrypts the content key (KD) for decrypting the content 12 into a form that is more amenable to decryption by the device 62. Here, and in one embodiment of the present invention, the content key is re-encrypted according to a symmetric key that is stored in a table 64 on the medium 61, where the symmetric key is encrypted according to a device key (DK) of the device 62.

In particular, and assuming that the content key (KD) in the license 16 on the computer 60 is encrypted according to an asymmetric key such as the black box public key of the host computer (PU-BB-HC) in the manner discussed above, the host computer obtains the content key (KD) by applying the black box private key of the host computer (PR-BB-HC) in the manner discussed above, then re-encrypts the content key (KD) according to the symmetric key (DK) of at least the device 62. Thus, and as should be appreciated, the content key (KD) is obtainable by the device 62 at the appropriate time by application of (DK), and the sub-license 16 s. As should be appreciated, without re-encrypting the content key (KD), the device 62, which would not know (PR-BB-HC), would not be able to decrypt (PU-BB-HC(KD)) to obtain (KD).

Procedures for creating the sub-license 16 s are set forth in greater detail in the aforementioned U.S. patent application Ser. No. 09/892,371, and therefore need not be set forth herein in any detail. Any variations on such procedures that are necessary in view of the present invention should be apparent to the relevant public based on U.S. patent application Ser. No. 09/892,371.

Referring still to FIG. 13, to download the digital content 12 and the corresponding license 16 or sub-license 16 s to the medium 61, such medium 61 must be coupled to the source 60 by way of a connection 63 which may be any appropriate connection without departing from the spirit and scope of the present invention. As may be appreciated, if the medium 61 is some form of portable writable storage, the connection 63 is an appropriate drive to which the medium 61 is mounted. Likewise, if the medium 61 is internal to the device 62, the connection 63 may be an appropriate cable, a wireless link such as an RF or IR link, or the like. Such connections 63 and hardware and/or software in support thereof are known or should be apparent to members of the relevant public and therefore need not be described herein in any further detail.

Notably, the device 62 may be deemed particularly trustworthy based on its simplicity. That is, the simple device 62 may have limited functionality and accessibility and therefore may be particularly invulnerable to attacks by a content thief or other nefarious individual. Accordingly, and in such a situation, the sub-license 16 s is not strictly necessary. Instead, the content 12 may be placed on the medium 61 encrypted according to a symmetric key available to the device 62 by way of the table 64, and the device 62 may render the encrypted content 12 at will by way of the symmetric key of the table 64. Of course, to do so, the content 12 as obtained by the host computer 60 likely must be decrypted and then re-encrypted according to the symmetric key in a manner similar to that set forth above. Details and methods for doing so should be apparent to the relevant public based on the present disclosure.

Alternatively, the content 12 may be placed on the medium 61 in an unencrypted form but accessible by the device only with a password or the like available to the device 62 by way of the table 64, and the device 62 may render the encrypted content 12 at will by way of the password in the table 64. Here, too, the content 12 as obtained by the host computer 60 likely must be decrypted and then password-protected. Details and methods for doing so should be apparent to the relevant public.

As set forth above, the content key (KD), password for the content 12, or the like (hereinafter ‘secret’) for accessing the content 12 on the medium 61 is encrypted at least according to the device key (DK) of the device 62. Such device 62 is assumed for purposes of the present invention to be unable to communicate its device key (DK) to the medium 61 or the host computer 60, even though such capability may indeed be present without departing from the spirit and scope of the present invention. Accordingly, the entity encrypting the content key (KD) for the content 12 must already be in possession of such device key (DK). Notably, there could potentially be millions of such devices 62, if not more, and each device 62 could have its own presumably unique device key (DK). However, the aforementioned encrypting entity likely could not be expected to know the unique device key (DK) for every such device 62.

In one embodiment of the present invention, then, each device 62 has a non-unique device key (DK), whereby the number of device keys (DK) that the aforementioned entity must possess is kept at a manageable level. Nevertheless, each device 62 could have its own unique device key (DK) without departing from the spirit and scope of the present invention. Assuming, though, that each device 62 has a non-unique device key (DK), distributing the non-unique device keys (DK) to devices 62 may be done in any appropriate manner without departing from the spirit and scope of the present invention. For example, each manufacturer of a device 62 could be assigned a particular device key (DK), whereby all devices 62 manufactured thereby are provided with such manufacturer-specific (DK). Likewise, each model of a device 62 could be assigned a particular (DK). Similarly, each manufacturer or model of a device 62 could be assigned a number of device keys (DK) that are either randomly or purposefully provided to specific ones of devices 62.

A host computer 60 downloading protected content 12 (either encrypted or password-protected) to a medium 61 doesn't necessarily know what device 62 the medium 61 is to be mounted to or is internal to. Accordingly, and as seen in FIG. 13, in one embodiment of the present invention, the host computer 60 also downloads the table 64, where such table 64 has therein the secret of the content 12 encrypted according to each of several device keys (DK) that are known. As seen, each encrypted secret has a corresponding index value specifying an identifier of the device key (DK) that encrypted the secret.

In one embodiment of the present invention, then, the table 64 includes therein the secret encrypted according to the device key (DK) of the device 62 that is to be employed to render the corresponding content 12. Note that the table 64 may have the secret encrypted according to every device key (DK) that is known to the host computer 60, or to a specific sub-set thereof, all without departing from the spirit and scope of the p resent invention. For example, a user effectuating such a download may specify that the device 62 is manufactured by a particular manufacturer, and the table 64 thus includes the secret encrypted according to every device key (DK) of the manufacturer. Likewise, the user may specify that the device 62 may be any of a number of particular devices 62, and the table 64 thus includes the secret encrypted according to every device key (DK) of such number of particular devices 62.

To render the content 12 on the medium 61, then, the device 62 refers to the table 64 on the medium 61 that corresponds to the content 12 and indexes to the secret encrypted according to the device key (DK) of such device 62. In particular, and referring now to FIG. 14, the device 62 upon being directed to render the content 12 (step 1401) obtains the table 64 corresponding thereto (step 1403), obtains the device key (DK) thereof and the index value of such (DK) (step 1405), indexes into the table 64 based on the obtained index value (step 1407), and selects the corresponding encrypted secret (step 1409). The device 62 then applies the obtained device key (DK) to the encrypted secret to expose the secret (step 1411), and applies the exposed secret to render the corresponding content 12 (step 1413). Note that the secret may directly allow rendering of the content 12, such as for example if the secret may be employed to decrypt the content 12, or the secret may be applied to a license 16 or sub-license 16 s to allow rendering of the content 12.

In one embodiment of the present invention, the table 64 on the medium 61 is a common table 64 that corresponds to a plurality of pieces of content 12 on the medium 61, where each of the plurality of pieces of content 12 is protected by a single common secret. Accordingly, to render any of the plurality of pieces of content 12 on the medium 61, a device need only refer to the common table 64 to obtain the common secret. Thus, substantially the same method as shown in FIG. 14 may be employed.

As set forth above, the table 64 produced by the host computer 60 may have the secret encrypted according to every device key (DK) that is known to the host computer 60, or to a specific sub-set thereof. In the latter case, exclusion of a device key (DK) from the sub-set in the table 64 bars a corresponding device 62 from rendering the corresponding content 12. In the former case, a corresponding device 62 is similarly barred from rendering the content 12 by leaving blank the field in the table 64 for the corresponding encrypted secret. Alternatively, such field maybe filled with any alternate data such as gibberish or nonsense data.

In one embodiment of the present invention, each device 62 is provided with more than merely a single device key (DK). Accordingly, the device 62 attempts to employ each (DK) on the table 64 until one is found to expose the secret needed to render the content 12. In such embodiment, if it is found to be necessary to invalidate the device 62 (as being non-trustworthy, e.g.), the host computer must leave out from the table 64 the entries that would correspond to all of the device keys (DK) of the device 62. In such a situation, an invalidated device 62 with device keys A, B, C, and D would result in the ‘cancellation’ of such device keys A, B, C, and D from the table 64. Note that in such situation, a device 62 with device keys B, C, D, and E would still be able to access from the table 64 the secret as indexed under device key E, assuming device key E was not canceled too, but not the secret as indexed under device keys B, C, or D.

In one embodiment of the present invention, the host computer 60 in creating the table 64 to be downloaded to the medium 61 and protecting the content 12 to be downloaded to the medium ties the table 64 and the content 12 to the medium 61. Thus, the table 64 and contents 12 cannot be freely transported to other media 61. Here, tying of the content 12 occurs by having the content 12 be exposed by way of a final secret that is a combination of the secret as exposed from the table 64 and an ID identifying the medium 61. The ID of the medium 61 may be any appropriate ID without departing from the spirit and scope of the present invention. For example, the ID may be a serial number permanently associated with the medium 61. The final secret may be a one-way hash of the secret and the ID, such as for example may be obtained based on a SHA or HMAC algorithm. Accordingly, the final secret may not easily be decomposed into the secret.

In one embodiment of the present invention, the table 64 is tied to the medium 61 by having the ID of the medium 61 securely built in. The ID may be securely built into the table 64 by being employed as at least one basis for a signature attached to the table. Alternately, the ID may be encrypted or signed by the secret of the table 64.

As should be appreciated, the ID of the medium 61 is collected by the host computer 60 prior to constructing the table 64 and preparing the content 12 for such medium 61, and the table 64 and content 12 are in fact constructed/prepared by the host computer 60 to be tied to the medium 61. To verify the table 64 is associated with the medium 61, then, and referring now to FIG. 15, the device 62 accesses the ID from the medium 61 (step 1501), accesses the ID from the table 64 (step 1503), and compares the two IDs to determine whether they match (step 1505). If so, the rendering is allowed to proceed (step 1507). Note that accessing the ID from the table 64 at step 1503 may involve verifying the signature of the table 64 to confirm that the accessed ID has not been tampered with (step 1503 a), or applying the exposed secret (step 1411 of FIG. 14) to the encrypted ID to reveal same (step 1503 b).

To verify that the content 12 is associated with the medium 61, the device 62 applies the exposed secret and the verified ID to the hash to produce the final secret (step 1509). Of course, such verification occurs if the final secret successfully allows rendering of the content 12 (step 1511). Note that the device 62 may simplify verification of the ID by accessing the ID from the medium (step 1501) and applying the exposed secret and the accessed ID to the hash to produce the final secret (step 1509) only. If the produced final secret fails to render the content 12, the device 62 may then verify the table 64 in an effort to explain the failure.

As set forth above, a first signature of the table 64 based on the ID of the medium 61 may be employed to verify the ID associated with the table 64. Similarly, the entire table or a portion thereof may be the basis of a second signature provided by an authorizing agent. The second signature is not needed by the device 64 to render the content 12, but may be employed as a security precaution for devices or applications adding new content 12 to a medium 61 with an existing table 64. In particular, the second signature verifies that the existing table 64 was created by the authorizing agent, rather than by a nefarious entity. The second signature also helps validate the version number (see below) of the table 64 and thus the ‘freshness’ of the table 64.

It is to be recognized that details within the table 64 on the medium 61 may need to be updated or modified from time to time. For example, a device 62 may become invalidated and the table entries for the device keys (DK) therefor may need to be removed, and/or new entries may need to be added, and/or the secret of the table 64 may need to be changed. Difficulties especially arise when the medium 61 can be updated, but old content 12 and capabilities must simultaneously be retained. Such is the case when a host computer 60 writes new (protected) content 12 to the medium 61 and old (protected) content is already present thereon, particularly if the table 64 is relatively old. In this case, and in one embodiment of the present invention, the old table 64 on the medium 61 which has an old secret is replaced with a new, updated table 64 which has a new secret. The new table 64 with the new secret of course supports the new content 12 on the medium 61 protected by such new secret. Significantly, the new table 64 should also support the old content 12 on the medium 61 protected by the old secret. All devices 62, including invalidated devices 62, must retain access to old content 12.

This is accomplished by a table 64 such as that shown in FIG. 16, where the table 64 itself and each entry in the table 64 are given a non-decreasing version value relative to a master table 68 maintained by an administrator. The administrator may be any appropriate entity without departing from the spirit and scope of the present invention, and principally is responsible for maintaining within the master table 68 each and every symmetric device key (DK) that will possibly go into any table 64.

In addition to each device key (DK), the administrator may also maintain information in the master table 68 such as for example an index value and a valid flag for each device key (DK). As may be appreciated, the administrator decides when a device key (DK) is no longer trustworthy and therefore to be invalidated, or receives such decision from another entity, and accordingly marks the valid flag for such device key (DK). Of course, the master table 68 may have other information without departing from the spirit and scope of the present invention. Significantly, the master table 68 also includes a version value, and each time the administrator changes the master table 68, the version value thereof is incremented. Such version value may be a version number, date, or other increasing value.

Each time a table(N) 64 on a medium 61 with secret(N) is replaced by a new table(N+1) 64 with a new secret(N+1), new content 12 placed on the medium 61 thereafter is linked to the new secret(N+1). Simultaneously, within any new table 64, each secret(N) encrypts and protects the previous secret(N−1) such that all secrets ever associated with the medium 61 and the content 12 thereon are accessible from a ‘daisy chain’ of the secrets. This allows a device 62 that can access a particular secret within the daisy chain to by extension access all earlier secrets in the daisy chain, but not any of the later secrets. Of course, a device 62 should be able to access the latest secret of the medium 61 unless such device 62 was invalidated.

Based on the above, methods for facilitating, effectuating, and supporting the content 12 and the table 64 on the medium 61 are set forth below.

Referring now to FIG. 17, to write a new secret table 64 to a medium 61 without any table 64 thereon, the host computer 60 first obtains such table 64 from a cache 66 (FIG. 13) (step 1701). The cache 66 contains at least one secret table 64, where each table 64 is based on a different secret, as obtained from the master table 68 and the administrator thereof by way of a table server or the like (not shown). Production of the tables 64 by or for the table server to be distributed to the cache 66 may be done by any appropriate method without departing from the spirit and scope of the present invention.

For example, to produce a table 64, the table server or another device may have access to the master list and a random number generator, and may employ the random number generator to produce a secret value. For each valid device key (DK) in the master list, then, such device key (DK) is employed to encrypt the generated secret, and such encrypted secret is appropriately placed in the table 64 being produced. Note, though, that for each invalid device key (DK) in the master table 68, the secret is not encrypted thereby and placed in the table 64 being produced. Instead, the space for such (DK-X(SECRET)) is merely left blank or is filled with some pre-determined value such as 0. In addition, the version number of the master list is adopted as the version number of the table 64 being produced and placed therein in an appropriate location, and the table 64 including the version number thereof is signed by a private key of the administrator or another appropriate entity (i.e., the authorizing agent above).

As should now be appreciated, one or more tables 64 are placed in the cache 66 at appropriate times, based on demand or the like. It may alternately be the case that a new table 64 is obtained on demand directly from the table server operating as the cache 66. Note that the host computer 64 may use a table 64 from the cache 66 once or more than once without departing from the spirit and scope of the present invention.

As with the device 62, the host computer 60 has a device key (DK) that indexes into any table 64. Accordingly, the host computer 60 employs the device key (DK) and the index value thereof to find the corresponding entry in the obtained table 64 and reveal the secret of such table 64 (step 1703). Note that the host computer 60 may have several device keys (DK). If it is the case that none of the key entries in the obtained table 64 match the latest table version, the device keys (DK) of the host computer are obsolete or revoked and must be updated before any content 12 may be written to the medium 61.

With the secret of the obtained table 64 revealed, the host computer obtains the ID number of the medium 61 therefrom (step 1705) and appends such ID number to the obtained table 64 (step 1707). Since the table 64 is the first to be placed on the medium 61, the host computer 60 either assigns a version number such as 0 or 1 to the table or such table 64 already includes such a version number. The host computer 60 then encrypts or signs with the secret to bind the table 64 to the medium 61 by way of the ID number thereof (step 1709), assuming the ID number is in fact employed. Thereafter, the host computer 60 copies the table 64 to the medium 61 (step 1711).

Assuming now that the medium 61 already has a table 64 thereon and is to receive new content 12, and referring now to FIG. 18, the host computer preliminarily checks the table 64 on the medium 61 to see if the signatures therein verify (step 1801). If not, the medium 61 is likely bad and should be reformatted. In addition, the host computer 60 obtains the version number of the table 64 and/or other information on the medium 61 (step 1801) and determines based thereon if such table 64 is obsolete (step 1803). For example, the host computer 60 may determine based on the obtained version number and/or other information that the table 64 is relatively old, or that the table 64 does not reflect certain invalidated devices 62. In addition or in the alternative, a term in a license 16 corresponding to the new content 12 may require that the table 64 be updated to a newer version number. For example, if the version number of the table 64 on the medium 61 is 40 and such a term requires such version number to be at least 60, the table 64 must be updated.

If the table 64 on the medium 61 must in fact be updated, the host computer creates a new (N+1)th table 64 to replace the (N)th table 64 already on the medium 61 (step 1805) and places same thereon (step 1807). In particular, and referring now to FIG. 18A, the host computer obtains the (N+1)th table 64 with an (N+1)th secret from the cache 66 (step 1805 a), obtains the (N+1)th secret as in FIG. 17 (step 1805 b), and binds the (N+1)th table 64 to the medium 61 as in FIG. 17 (step 1805 c). Note that the (N+1)th table 64 as obtained from the table server by way of the cache 66 already has a more up-to-date version number in an appropriate location. Also, the host computer 60 obtains the (N)th secret from the (N)th table 64 on the medium 61 and if present a daisy chain of previous secrets in the (N)th table 64 (step 1805 d). The host computer then extends the obtained daisy chain by one to add the (N)th secret thereto encrypted according to the (N+1)th secret as the next link in the daisy chain of secrets (step 1805 e), and adds the extended daisy chain to the (N+1)th table 64 (step 1805 f).

The host computer 60 also adjusts the (N+1)th table to include old secrets for device keys (DK) that have been invalidated, and assigns a version number to each entry. In particular, the host computer 60 determines from the (N+1)th table 64 which device keys (DK) are invalidated (step 1805 g), and populates the entry in such (N+1)th table 64 for each invalidated (DK) with the corresponding entry in the (N)th table 64, along with the version number of such corresponding entry (step 1805 h). Note that the host computer 60 may for example determine from the (N+1)th table 64 which device keys (DK) are invalidated by determining which entries in such (N+1)th table are empty or are filled with some pre-determined value such as 0.

The host computer 60 may then assign the version number of the (N+1)th table 64 to all device key entries therein not changed and therefore still valid. Alternatively, the table server that created the (N+1)th table 64 already performed such assignment. Thus a valid device 62 with a valid device key (DK) can access the latest ((N+1)th) secret of the (N+1)th table 64. Correspondingly, an invalidated device 62 with an invalidated device key (DK) can access a corresponding secret in the (N+1)th table 64, but the secret is that of a previous table 64 for the medium 61, not from such (N+1)th table 64. As set forth above, with such accessed secret, the device 62 can by extension access all earlier secrets in the daisy chain, but not any of the later secrets.

Once the entries in the (N+1)th table are properly adjusted, the host computer 60 then encrypts or signs the (N+1)th table 64 with the (N+1)th secret to bind the (N+1)th table 64 to the medium 61 by way of the ID number thereof as in FIG. 17 (step 1805 i). Finally, the (N+1)th table 64 is copied to the medium 61 as at step 1807 to replace the (N)th table 64 thereon.

Assuming now that a medium 61 has thereon a current table 64 with a current secret, a version number relative to the master table 68, an ID number, and by extension a final secret derivable from the secret and the ID number, the host computer 60 may write content 12 to the medium 61. To do so, and referring now to FIG. 19, the host computer 60 obtains the ID number from the medium 61 (step 1901), obtains the secret from the table 64 on the medium 61 (step 1903), confirms the signatures of the table 64 (step 1905), and confirms that the ID number in the table 64 matches the ID number of the medium 61 (step 1907). Assuming the confirmations are positive, the host computer 60 then combines the obtained secret and the ID number to determine the final secret according to a pre-determined function such as was set forth above (step 1909), encrypts the content 12 to be written to the medium 61 according to the final secret (step 1911), thereby binding the content 12 to the medium 61, and copies the encrypted content 12 to the medium 61 (step 1913). Thereafter, the host computer 60 may take any appropriate post-copying action as necessary and appropriate. For example, if the content 12 is supplied as part of a financial transaction, the host computer may mark the transaction complete, charge an account, increment or decrement a count value, etc.

Note that the steps performed in connection with FIG. 19 do not take into consideration whether the device 62 to which the medium 61 is to be mounted or is internal to is valid and thus has valid device key(s) (DK). In fact, the host computer 60 likely has no way of verifying such issue prior to writing the content 12 to the medium 61. If in fact an invalidated device 62 attempts to render the content 12 on the medium 61, where the content 12 is encrypted according to a secret later than any secret accessible by the invalidated device 62 from the table 64 on the medium 61, the attempt will fail.

Once content 12 has been copied to the medium 61, such content 12 may be rendered by any device 62 that has compatible software and that can read the medium 61 and that can accept same (if the medium 61 is separate therefrom). Of course, the device 62 must have an appropriate DRM system 32 s and a symmetric device key (DK) that indexes into the table 64 on the medium 61. In addition, the device 62 cannot have been revoked or invalidated from the table 64 and not be able to access from the table 64 the secret necessary to render the content 12.

To render the content 12 on the medium 61 by the device 62, and referring now to FIG. 20, such device 62 obtains the ID number from the medium 61 and from the table 64 on the medium 61 (step 2001), and compares same to the ID number in the table 64 thereon to confirm that the table 64 belongs on the medium 61 (step 2003). Assuming the compare succeeds, the device 62 then obtains a version number associated with the content 12 to be rendered (step 2005). Note that the version number of the content 12 may be located at any appropriate location without departing from the spirit and scope of the present invention, and corresponds to the version number of the table 64 the secret thereof having been employed to protect the content 12. For example, the version number may be placed in the or attached to the content 12 by the host computer 60 prior to downloading same to the medium 61, or may be placed by such host computer in a license 16 or sub-license 16 s that accompanies the content 12.

The device 62 then employs the index value(s) of the device key(s) thereof to obtain the corresponding encrypted secret(s) and the version number(s) thereof from the table 64 (step 2007). As may be appreciated, the device 62 then determines whether the highest version number of the obtained encrypted secret(s) is lower than the version number of the content 12. If so, the content 12 cannot be rendered by the device (step 2009). If not, one of the encrypted secrets having a version number greater than or equal to the version number of the content 12 is selected (step 2011). The selected encrypted secret should have the version number of the content 12 so that no traversal of the daisy chain is necessary, or should be closest to such version number of the content 12 so that traversal of the daisy chain is as brief as possible.

The device 62 then obtains the device key (DK) thereof corresponding to the selected encrypted secret (step 2013) and applies same to reveal the secret (step 2015). If necessary, the revealed secret is then employed to traverse the daisy chain in the table 64 back to the secret employed to protect the content 12, and such secret of the content 12 is revealed thereby (step 2017). As should be appreciated, the version number of the selected encrypted secret is employed to determine where to enter the daisy chain, and the device 62 traverses back in the daisy chain to the appropriate version number that reveals the secret of the content 12.

Once the secret of the content 12 is revealed, such secret and the ID number of the medium 61 are applied to determine the final secret (step 2019), and the final secret may then be employed to render the content 12, presuming any corresponding license 16 or sub-license 16 s corresponding to the content 12 is satisfied.

Note that in the course of providing an (N+1)th table 64 to a medium in place of an (N)th table 64 already thereon, it may be the case that the version number of the (N+1)th table 64 is not the next version number of the (N)th table 64. Instead, and as seen in FIG. 16, it may be the case that the (N)th table 64 was created from version number 19 of the master table 68 and therefore has a version number of 19, and the (N+1)th table 64 was created from version number 25 of the master table 68 and therefore has a version number of 25. Since all content 12 downloaded to the medium 61 is protected according to the secret of the current table 64, and the table 64 on the medium 61 changed from version number 19 with SECRET19 to version number 25 with SECRET25, it is not likely possible that content 12 downloaded after table 64 changed to version number 19 could be protected by any secret other than SECRET19 or SECRET25.

As was set forth above, the table 64 as produced by the table server or the like is signed by a private key of the administrator or another appropriate entity. However, at step 1805 h of FIG. 18, the host computer 60 populates the entry in such (N+1)th table 64 for each invalidated (DK) with the corresponding entry in the (N)th table 64, along with the version number of such corresponding entry. Thus, when the host computer 60 confirms such table server signature as at step 1905 of FIG. 19, such confirmation will fail unless the host computer 60 first fixes up each populated entry to reflect the state thereof at the time of the table server signature. Such fixing up should be apparent to the relevant public and therefore need not be described herein in any detail.

As described in connection with the drawings, the secret or final secret as obtained from the table 64 decrypts or provides access to the content 12 itself. Equivalently, it may be the case that the secret or final secret as obtained from the table 64 decrypts or provides access to a content key for the content 12, where the content key is located within the content 12, a license 16 or sub-license 16 s for the content 12, or elsewhere. As may be appreciated, protecting the content key according to secret or final secret means that the content 12 need not be protected in a way that is specific to any particular media. Nevertheless, the content 12 is still tied to the medium 61 by virtue of being accessible only by the content key, which is tied to the medium 61 by being protected by the secret or final secret of the table 64 on the medium 61.

Also as described in connection with the drawings, the version number runs with the master table 68. However, it may instead be the case that the version number runs with the medium 61, for example, without departing from the spirit and scope of the present invention. Note that if the version number runs with the medium 61, the host computer 60 would among other things be responsible for determining the version number of an (N)th table 64 and incrementing same in the course of creating an (N+1)th table 64 for a medium 61.

As the version number of the master table 68 increases, there will be fewer and fewer valid device key entries in any table 64. Thus, it may be desirable to extend the master table 68 and tables 64 to add new entries. Assume for example that a master table 68 has 10 entries, 1-10. Over time, the device keys (DK) that are the bases of the entries become compromised and are invalidated in the master table 68. At the point where a single valid entry (3, for example) is left in the master table 68, it is decided to extend such master table 68 by adding entries 11-20. Thus, all new tables 64 are based on the extended master table 68 where, entries 1, 2, and 4-10 are invalid, and entries 3 and 11-20 are valid. Device keys (DK) corresponding to entries 3 and 11-20 may then be distributed to the next generation of devices 62 for reading new content 12.

Crucially, one the last device key to be invalidated (DK-9, for example) is also be distributed to the next generation of devices 62. That is, every new device 62 should include the device key (DK-9) corresponding to entry 9. Although (DK-9) has already been compromised, further distribution will not weaken that penetration. But since all “first generation” content 12 considered (DK-9) to be valid, such (DK-9) can be employed by such first generation content 12 to provide access thereto.

In this manner, the last invalidated device key (DK) has special value. Since it has been compromised, it may be widely distributed. But since it hasn't been revoked until the issuance of the “second generation” extended table 64, it provides access to all first generation content 12. Thus, the last invalidated device key (DK) serves to bridge the two generations and serves as the crucial element for extending the new table 64. Note that in the present example, DK-3) could also serve as a bridge since it provides access to all old content 12, but there may be reluctance to distribute it too widely, since it has not been compromised yet.

Although the present invention is particularly directed to a simple device 62 that can only perform symmetric encryption and decryption, such invention may also be employed by a simple device 62 or any other device performing asymmetric encryption and decryption. Of course, to do so, particular entries in the table 64 would encrypt the secret thereof according to a private key and the device would have a corresponding public key. Other necessary alterations to accommodate asymmetric encryption and decryption should be apparent to the relevant public and therefore need not be described herein in any detail.

CONCLUSION

Although the present invention is especially useful in connection with a relatively small and/or simple device 62 with limited functionality such as was set forth above, the present invention may be practiced with regard to any appropriate device, be it relatively simple or relatively complex, all without departing from the spirit and scope of the present invention, such as for example a personal computer, a server, an intelligent appliance, etc. More concretely, the present invention for example could be used to enable a CD player to play a CD with protected music, to allow a set-top box to have access to a premium television broadcast, etc. Accordingly, ‘simple device’ is to be interpreted to encompass any device 62 that has a device key (DK) and that can receive content 12 and an accompanying table 64 of secrets and obtain the secret to render the received content 12 from the table based on (DK), or the like.

The programming necessary to effectuate the processes performed in connection with the present invention is relatively straightforward and should be apparent to the relevant programming public. Accordingly, such programming is not attached hereto. Any particular programming, then, may be employed to effectuate the present invention without departing from the spirit and scope thereof.

In the foregoing description, it can be seen that the present invention comprises a new and useful method and mechanism that allows the digital rights management architecture 10 to be extended to a relatively small and/or simple device 62. Such architecture 10 allows for encryption and data-protection for content 12 on the relatively small device 62, even though the device 62 upon which the content 12 is to be rendered is relatively small and/or simple and does not have relatively complex capabilities such as performing asymmetric key decryption and communicating with a remote entity over a network connection or the like. It should be appreciated that changes could be made to the embodiments described above without departing from the inventive concepts thereof. It should be understood, therefore, that this invention is not limited to the particular embodiments disclosed, but it is intended to cover modifications within the spirit and scope of the present invention as defined by the appended claims. 

1. A method performed in combination with a host computer and a device having a device key (DK) with a pre-selected index value, the device for receiving a storage medium or having the storage medium, the storage medium having stored thereon digital content protected according to a secret and a table with a plurality of entries therein, each entry including the secret encrypted according to a key decryptable by the device key (DK) of one of a plurality of devices and an index value, the medium including a first ID thereon identifying such medium and comprising a serial number permanently associated with the medium, and the table including a second ID of the medium stored therein, wherein the table is tied to the medium by the second ID, the method for the device to render the content on the medium and comprising: receiving a request to render the content on the medium; obtaining the table from the medium; obtaining the first ID of the medium therefrom; obtaining the second ID of the medium as stored in the table; comparing the first ID and the second ID to each other; and if the first ID and the second ID match, proceeding by: obtaining the device key (DK) of the device and the index value of such (DK); indexing into an entry of the table based on the obtained index value; selecting the encrypted secret from the indexed-into entry; applying the obtained device key (DK) to the selected encrypted secret to expose the secret; and applying the exposed secret to render the corresponding content.
 2. The method of claim 1 wherein the secret comprises one of a symmetric key, a content key for the content, and a password.
 3. The method of claim 1 wherein the device has a plurality of device keys (DK), each with a pre-selected index value, the method comprising: obtaining the device keys (DK) of the device and the index values of such device keys (DK); for each obtained device key (DK): indexing into an entry of the table based on the corresponding obtained index value; selecting the encrypted secret from the indexed-into entry; and applying the obtained device key (DK) to the selected encrypted secret to expose the secret, until the secret is in fact exposed.
 4. The method of claim 1 wherein the medium includes an LID thereof thereon and has stored thereon the digital content protected according to a final secret derived from a combination of the secret and the ID, wherein the content is tied to the medium by the ID, the method comprising: applying the obtained device key (DK) to the selected encrypted secret to expose the secret; obtaining the ID of the medium therefrom; applying the exposed secret and the obtained ID to a pre-determined function to produce the final secret; and applying the produced final secret to render the corresponding content.
 5. The method of claim 4 comprising applying the exposed secret and the obtained ID to a one-way hash function to produce the final secret.
 6. The method of claim 1 wherein the table includes a signature based at least in part on the ID of the medium as stored therein, the method further comprising verifying the signature to verify the ID.
 7. The method of claim 1 wherein the table includes the ID of the medium encrypted according to the secret as exposed, the method comprising obtaining the ID by applying the secret to the encrypted ID to reveal same.
 8. The method of claim 1 wherein the device key (DK) is a symmetric key.
 9. The method of claim 1 wherein the table on the medium is updated periodically to have a new secret and has a daisy chain of prior secrets, each prior secret in the daisy chain being encrypted according to an immediately following secret to form a series of links, and where each entry of the table includes the new secret or one of the prior secrets encrypted according to the device key (DK) of one of a plurality of devices, an index value, and a version number for the encrypted secret of the entry, and wherein the content to be rendered has a version number corresponding to the secret in the daisy chain protecting such content, the method comprising: determining the version number of the content; selecting the encrypted secret from the indexed-into entry; determining the version number of the selected encrypted secret; applying the obtained device key (DK) to the selected encrypted secret to expose the selected encrypted secret; determining based on the version number of the selected encrypted secret an entry point into the daisy chain; traversing back from the entry point of the daisy chain to expose the secret protecting the content; and applying the exposed secret to render the corresponding content, wherein a device may traverse the daisy chain from the entry point to obtain earlier secrets but not later secrets.
 10. The method of claim 9 further comprising: determining based on the version number of the selected encrypted secret and the version number of the content whether the secret can be employed to render the content, and proceeding only if the version number of the selected encrypted secret is not lower than the version number of the content and therefore can be employed to render the content.
 11. A method performed in combination with a host computer and a plurality of devices each having a device key (DK) with a pre-selected index value, each device for receiving a storage medium or having the storage medium, the storage medium including an ID thereof thereon, and having stored thereon digital content protected according to a secret and a table with a plurality of entries therein, each entry including the secret encrypted according to a key decryptable by the device key (DK) of one of a plurality of devices and an index value, the method for the host computer to provide the medium with the table and comprising: obtaining the table from a cache; obtaining the ID of the medium therefrom, the ID of the medium comprising a serial number permanently associated with the medium; appending the ID of the medium to the table; employing a device key (DK) and the index value thereof to find the corresponding entry in the obtained table and expose the secret of such table, by: obtaining the table from the medium; obtaining the device key (DK) of the host computer and the index value of such (DK); indexing into an entry of the table based on the obtained index value; selecting the encrypted secret from the indexed-into entry; and applying the obtained device key (DK) to the selected encrypted secret to expose the secret; tying the table to the medium by the ID of the medium and the exposed secret; and copying the tied table to the medium.
 12. The method of claim 11 wherein tying the table to the medium comprises appending to the table a signature based at least in part on the ID of the medium and the exposed secret.
 13. The method of claim 11 wherein tying the table to the medium by the ID of the medium comprises encrypting the ID according to the exposed secret and appending the encrypted ID to the table.
 14. The method of claim 11 comprising obtaining the table from a cache having a plurality of tables, each being based on a different secret.
 15. The method of claim 11 further comprising assigning a version number to the table.
 16. The method of claim 11 wherein the provided table is an (N)th table, the method further comprising the host computer providing the medium with an (N+1)th, updated table to replace the provided (N)th table on the medium and comprising: obtaining the (N+1)th table with an (N+1)th secret from the cache; obtaining the ID of the medium therefrom; appending the obtained ID of the medium to the (N+1)th table; obtaining the (N+1)th secret from the (N+1)th table; obtaining the (N)th secret from the (N)th table on the medium and if present a daisy chain of previous secrets in the (N)th table, each previous secret in the daisy chain being encrypted according to an immediately following secret to form a series of links; extending the obtained daisy chain and adding the (N)th secret thereto encrypted according to the (N+1)th secret as another link in the daisy chain; adding the extended daisy chain to the (N+1)th table; adjusting the (N+1)th table to include old secrets for invalidated device keys (DK) and assigning a version number to each entry; tying the (N+1)th table to the medium by the ID of the medium and the obtained (N+1)th secret; and copying the adjusted (N+1)th table to the medium to replace the (N)th table thereon.
 17. The method of claim 16 wherein tying the (N+1)th table to the medium comprises appending to the (N+1)th table a signature based at least in part on the ID of the medium and the exposed secret.
 18. The method of claim 16 wherein tying the (N+1)th table to the medium by the ID of the medium comprises encrypting the ID according to the obtained (N+1)th secret and appending the encrypted ID to the (N+1)th table.
 19. The method of claim 16 wherein each entry in the (N)th table further includes a version number of the corresponding encrypted secret, and wherein adjusting the (N+1)th table to include old secrets for invalidated device keys (DK) and assigning a version number to each entry comprises: determining from the (N+1)th table which device keys (DK) therein are invalidated; populating the entry in such (N+1)th table for each invalidated (DK) with the corresponding entry in the (N)th table, along with the version number of such corresponding entry; assigning the version number of the (N+1)th table to all entries therein not populated from the (N)th table and therefore still valid, whereby a valid device with a valid device key (DK) can access the latest ((N+1)th) secret of the (N+1)th table, and an invalidated device with an invalidated device key (DK) can access a corresponding secret in the (N+1)th table that is earlier to the (N+1)th secret, and whereby with the accessed secret, the device can by extension access all earlier secrets in the daisy chain, but not any later secrets.
 20. The method of claim 11 wherein the device key (DK) is a symmetric key.
 21. A method performed in combination with a host computer and a storage medium including a first ID thereon identifying such medium and comprising a serial number permanently associated with the medium, and having stored thereon a table with a plurality of entries therein, each entry including a secret encrypted according to key decryptable by a device key (DK) of one of a plurality of devices and an index value, at least one of the secrets being a current secret of the table, the table including a second ID of the medium stored therein, wherein the table is tied to the medium by the ID, the method for storing digital content on the medium according to the current secret of the table and comprising: obtaining the first ID from the medium; obtaining the second ID of the medium as stored in the table; comparing the first ID and the second ID to each other; and if the first ID and the second ID match, proceeding by: obtaining the current secret from the table, by: obtaining the table from the medium; obtaining a device key (DK) of the host computer and the index value of such (DK); indexing into an entry of the table based on the obtained index value; selecting the encrypted secret from the indexed-into entry; and applying the obtained device key (DK) to the selected encrypted secret to expose the current secret; applying the obtained current secret and the obtained ID to a pre-determined function to produce a final secret; protecting the content to be stored on the medium according to the final secret, thereby tying the content to the medium by the ID thereof; and copying the protected content to the medium.
 22. The method of claim 21 comprising applying the obtained current secret and the obtained ID to a one-way hash function to produce the final secret.
 23. The method of claim 21 wherein the table includes the ID of the medium therein and a signature therein based on the ID of the medium, the method further comprising checking the signature to verify that the ID of the medium in the table matches the ID obtained from the medium.
 24. The method of claim 21 wherein the device key (DK) is a symmetric key. 